Introduction - If you have any usage issues, please Google them yourself
1. write AVL tree discrimination program, and determines whether a binary search tree is an AVL tree 2. implement basic operations on it is: Search, Insert, Delete, and Ascend 3. Basic operations dynamic presentations 4. extended A. achieve indexed AVL search tree, the basic operations on it: Search, Insert, Delete, IndexSearch, IndexDelete, Ascend