Question 13 (1 point)
Consider an AVL tree with the following shape:
Storing the following keys:
1, 10, 14, 19, 23, 27, 30, 35, 40, 45, 50, 53
Fill in the nodes with the given keys, so that this is a valid binary search tree. Hint:
the keys are given in the same order as an in-order traversal of the tree.
After deleting node 53 (which includes any necessary re-balancing), what is the value
of the key at the root of the new tree?
Your Answer: