4. (30 points) Given the following list of keys: 58, 259, 49, 38, 101, 65, 55, 43, 56 (a) show the step-by-step results while inserting the keys into a binary search tree structure (Lecture Note: Binary Search Tree, Page 5). (b) First delete 58 from this binary search tree. Then delete 49 subsequently (Lecture Note: Binary Search Tree, Page 16). (c) Show the best insertion sequence to generate a perfect binary search tree from the original list of keys (Lecture Note: Binary Tree, Page 8; Lecture Note: Binary Search Tree, Page 15). 1 2 7 8 3 6 9 12 10 11 4 5 (a) show the step-by-step results of Depth first tree traversal with the stack implementation (Lecture Note: Tree, Page 43). (b) Given a tree, show the step-by-step results of breadth first tree traversal with the queue implementation (Lecture Note: Tree, Page 39). 18.250.49 38 101. 65, 55