Data Structures - Unit 3

1.Explain the different tree traversals with an application? 
. In order
• Explanation with an example
• Figure
. Preorder
• Explanation with an example
• Figure
.
Postorder
• Explanation with an example
• Figure

2. Define binary search tree? Explain the various operations with an example? 
. Definition
. Figure for binary search tree
. Operations
• Codings
• Explanation
• Example


3. Define AVL trees? Explain the LL, RR, RL, LR case with an example? 
. Definition
. LL, RR, RL, LR case
• Figure
• Example
• Explanation

4. Define priority queue? Explain the basic heap operation with an example? 
. Definition
. Basic operation
• Insert
• Delmin
• Delmax
. Coding
. Explanation
. Example

5. Explain any two techniques to overcome hash collision?
. Separate chaining
• Example
• Explanation
• Coding
. Open addressing
• Linear probing
• Quadratic probing