i am curious about one question: In the AVL tree, a leaf vertex is removed without further balancing. The whole tree is then traversed in order, with each vertex being check
