Problem
1. Write a C++ method to remove a node from an AVL tree, following the steps outlined in the text.
2. Substitute the AVL tree class into the menu-driven demonstration program for binary search trees in, thereby obtaining a demonstration program for AVL trees.
3. Substitute the AVL tree class into the information-retrieval project of. Compare the performance of AVL trees with ordinary binary search trees for various combinations of input text files.