Show by example that a single erase operation in an AVL tree may require n trinode restructurings (or rotations) to restore the height-balance property.