Question 1: marks 2

Construct the max heap & Min heap for the following data elements

97, 88, 66, 55, 95, 48, 66, 35, 48, 62, 77, 25

Question 2: marks 2

1. Construct the binary search tree of the following: after construction delete 11

14, 10, 17, 12, 10, 11, 20, 12, 18, 25, 20, 8, 22, 11, 23

Question 3: marks 2

Draw the AVL tree after each of the following inserts in succession, i.e., one after the other.

Note: Show only the perfect (by rotating nodes) tree after each insertion.

1. insert(15)

2. insert(17)

3. insert(18)

4. insert(21)

5. insert(23)

6. insert(25)

7. insert(31)

8. insert(38)

9. insert(34)

10. insert(40)