Problem
1. Draw a schematic of an AVL tree such that a single remove operation could require ?(logn) trinode restructurings (or rotations) from a leaf to the root in order to restore the heightbalance property.
2. Show how to perform an operation, removeAll(k), which removes all entries with keys equal to K, in a dictionary implemented with an AVL tree in time O(slogn), where n is the number of entries in the dictionary and s is the size of the iterator returned.