Problem 3

Next problem

Construct an AVL tree that is initially empty, then insert keys 32, 45, 34, 67, 98, 124, 5, 25, 29, 234, 1, in that order (32 first and 1 last). Draw the tree after each insertion and box the final tree Using the tree resulted from problem 3, delete 34, 25, and 124 in that order. Draw the resulting tree after each deletion. Using the tree above from problem 3 insert 17 assuming now that the tree is a splay tree. Now delete 25 assuming it is also a splay tree