Problems
1. (20 points) AVL Trees
(a) (10 points) Insert the following keys (in order) into an initially empty AVL tree:
(12, 8, 9, 20, 10, 15, 3, 11, 5)
Draw the tree after each insertion have completed.
(b) (2 points) From the tree in part (a), delete the node with key value 15. Show the tree
after the deletion.
(c) (3 points) From the tree in part (b), delete the node with key value 20. Show the tree
after the deletion.