Tutorial Tree 1. Use the following data to draw the following tree: 65, 50, 55, 45, 9, 12, 11, 6, 7, 56, 78, 85 a. Binary Search Tree. b. AVL tree Balance Tree) c. Max Heap Tree d. Min Heap Tree 2. Name the following type of node for each tree in Q1 a a. Root node b. Leaf node c. Ancestor of d. The child nodes for the biggest node in level 3. 3. By referring to Q1 a. traverse the tree by using all three traversal methods. a. pre-order b. In-order C. Post order 4. Delete the following node from Qla. tree in sequence: use left subtree remove algorithm if the data is having 2 childs. Delete 65: Delete 56; Delete 55 5. Draw a heap tree by referring to the following data. a. M. O, V.F, B, E, N.Q, Z.A.C. Y 6. Insert The following list in an AVL tree: 7,16,15,14,13,12,11,10,8,9