Algorithm

(A) The following questions apply to a (not necessarily balanced) binary search tree. (a) Insert the following values into an initially empty scorch tree: show the tree after each insertion: 8 1 2 6 5 3 4 7 10 9 (b) Determine the following elements from the search tree you constructed in (a): show the tree after each insertion: 1 2 8 5 (B) The following questions apply to a balanced binary search tree (AVI tree). (a) Insert these values unto an initially empty AVL tree: show the AVL tree after each insertion indicating precisely the rotations used: 8 1 2 6 5 3 4 7 10 9 (b) Delete the following 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: 1 2 8 5