Question III $(25$ points$)$:

a$)$ Draw the tree after inserting integers $8,3,27,10,81,2,19,6,22,4,25$ into an initially$-$empty

i$.$ Binary search tree.

ii$.$ AVL tree

iii. Min heap

b$)$ Draw the tree after deleting

i$.8$ from the Binary search tree by merging

ii$.2$ from the AVL tree

iii. $2$ from the Min heap

c$)$ Draw the tree after inserting $76$ into

i$.$ Binary search tree.

ii$.$ AVL tree

iii. Min heap

Note: The deletions in part b and the insertions in part c are for the generated trees in part a $.$

When you balance the tree or adjust the heap clearly illustrate the proccess. Thank you