说明：  数据结构课程设计 平衡二叉树操作的演示 1.本程序演示平衡二叉树的插入,删除,查找,。 2.首先要先初始二叉树为空树； 3.接着要实现平衡二叉树的插入，删除，，其中根据平衡二叉树插入，删除的算法要不停的把插入的元素平衡地插入，需要调用平衡分析函数和左右旋转函数，更新平衡二叉树；删除元素后也要调用平衡分析函数和左右旋转函数，更新平衡二叉树。 4.平衡二叉树的查找则可根据查找算法实现。比较简单。
(Curriculum design data structure balanced binary tree demo one operation. This procedure demonstration balanced binary tree insertion, deletion, search,. 2. First of all, the initial first binary tree is empty tree 3. And then to achieve a balanced binary tree insertion, deletion, which under the balanced binary tree insertion, deletion of the algorithm to keep the inserted element balanced insertion, the need to call a balanced analysis of function and around rotating function, a balanced binary tree update delete the element after the call to function and balance analysis around rotating function, a balanced binary tree update. 4. A balanced binary tree search can be the basis of the search algorithm. Relatively simple.)