Problem
1. Show that at most one node in an AVL tree becomes unbalanced after operation removeExternal is performed within the execution of a remove dictionary operation.
2. Show that at most one trinode restructuring operation is needed to restore balance after any insertion in an AVL tree.