Algorithm

The following questions apply to a (not necessarily balanced) binary search tree. (a) Insert these values into an initially empty search tree: show the tree after each insertion: 4 67 8 9 0 1 2 3 5 (b) Delete these elements from the search tree you constructed in (a): 6 2 8 5 4 (B) The following questions apply to a balanced binary search tree (AVL tree). (a) Insert these values into an initially empty AVL tree: show the AVL tree after each insertion, indicating precisely the rotations used: 4 6 78 9 0 1 2 3 5 (b) Delete these elements from the AVL tree you constructed in (a): make sure you rebalance as needed and show your AVL tree after each deletion, indicating precisely the rotations used: 6 2 8 5 4