Draw a schematic of an AVL tree such that a single remove operation could require Omega(log n) trinode restructurings (or rotations) from a leaf to the root in order to restore the height balance property. This answer was already posted but the tree in the picture is NOT an AVL tree