Exercise 3 Is the following tree an AVL tree? Justify your answer by writing the balance of each node. 34 20 (22) 48 50 80 62 88 Exercise 4 Insert 46, 49, 37 into the tree from the previous exercise, rotate if necessary.

Please solve

Session Section 10 CPT 220 Final Exam The number of edges from the root to the node is called of the tree. a. Height b. Length c. Depth d. None of the mentioned

The elements in a binary tree are to be stored in an array, as described in this sec- tion. Each element is a nonnegative int value. a. Which value can you use as the dummy value, if the binary tree is not complete? b. Draw the array that would represent the following tree: 14 7 26 33 35 38 44 50 60