Answer all

3. Related to Binary Search Trees (A) The following questions apply to a (not necessarily balanced) binary search tree. (a) Insert the following values into an initially empty search tree; show the tree aftereach insertion: 8126 5347 10 9 (b) Delete the following elements from the search tree you constructed in (a); show the tree after each insertion: 182 5 (B) The following questions apply to a balanced binary search tree (AVL tree). precisely (b) Delete the following elements from the AVL tree you constructed in (a); makesure you rebalance as needed (a) Insert these values into an initially empty AVL tree; show the AVL tree after each insertion indicating the rotations used: 8 1 2 6 5 34 7 10 9 and show your AVL tree after each deletion, indicating precisely the rotations used: 1 8 2 5