(a) Draw the BST where the data value at each node is an integer and the values are entered in the following order: 36, 22, 10, 44, 42, 60, 50, 70, 80, 85, 75, 55, 45 (d) What is the height of the tree of part (a)? (e) Draw the BST on the following data 40, 30, 50, 20, 35, 45, 60, 25, 33, 42, 65. Now draw its mirror image BST Mirror of BST (1) Display the tree constructed in (e) using Breadth First Search or level order traversal. i.e. the BFS of above tree is given as a 5 3 7 1 4 8 (g) Given the In-Order {10 20 25 30 40 45 60} and Pre-Order {40 20 10 300 25 60 45}. Draw the original BST. Search yourself. (h) Given the In-Order {10 20 25 30 40 45 60} and Post-Order {10 25 30 20 45 60 40}. Draw the original BST. Search yourself.

C++  Sketch a left rotation on an AVL.  build the following AVL tree: insert 5insert 2insert 7insert 9insert 11  follow the insert algorithm draw out the original tree prior to any rotations-which node breaks the avl condition-label N, R, A, B, C, and the parent of N.-draw out the final tree after any rotation

6. Insert a Node with key 51 into the following AVL tree and draw the tree after performing all rotations. 30 50 52 55 1 60

7. Tree Drawing: Insert the integers 1 through 7 into an AVL tree, showing each step and rotation.

write the code fragment to Deleting a Node With One Child

12:34 A cs61a.org Implement add_d_leaves, a function that takes in a Tree instance t and a number v. We define the depth of a node in t to be the number of edges from the root to that node. The depth of root is therefore 0. For each node in the tree, you should add d leaves to it, where d is the depth of the node. Every added leaf should have a label of v. If the node at this depth has existing branches, you should add these leaves to the end of that list of branches. For example, you should be adding 1 leaf with label v to each node at depth 1, 2 leaves to each node at depth 2, and so on. Here is an example of a tree t (shown on the left) and the result after add_d_leaves is applied with v as 5. 3 2 3 2 4 4 5 5 5 Hint: Use a helper function to keep track of the depth! def add_d_leaves(t, v): """Add d leaves containing v to each ng