Question 1: Use print this tree using preorder, inorder, and postorder Traversal on this tree, give all three traversals. (I have added picture of tree)

Question 2: [0] [1] [2] [3] [4] [5] [6] [7] [8]

87 78 53 45 65 09 31 17 23

(This is an array with indices 0 to 8 and their values underneath them)

A heap is stored in an array. 1) Draw the heap based on the given array. Suppose this heap represents a queue. 2) Then dequeue elements one by one from this queue until the queue is empty. Draw the status after every dequeue operation (totally 9 figures, you just need to give the status after dequeue operation and reheapdown operation)

Question 3: AVL Tree Initial status is empty. Insert 50, 20, 60, 10, 8, 15 into this AVL tree in order. Draw every status of the tree

Question 1: Use print this tree using preorder, inorder, and postorder Traversal on this tree, give all three traversals