平衡二叉树源码，可直接编译运行。实现插入、删除、清空、查找、遍历等操作。

通过C基于AVLTree结构实现的动态平衡二叉搜索树，具有GUI界面，可用于增删改查，二叉树的图形绘制，二叉树的深度求取，二叉树的先序遍历、中序遍历和后序遍历等功能。

An AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property. Figures 1-4 illustrate the rotation rules.Now given a sequence of insertions, you are supposed to tell the root of the resulting AVL tree.

红黑树、平衡二叉树、B树、二叉搜索树和SPlay树的C++源码实现，带工程

C++平衡树实现

本设计实现了AVLTree的所有的实现功能，也包括BinSTree与AVLTree的转换