平衡二叉树，又称为AVL树，是1962年由Adelsonr Velskii 和Landis 提出并以他们的名字命名的，它是具有如下性质的二叉树：-balanced binary tree, also known as AVL tree, yes in 1962 by Adelsonr Velskii and Landis made and named after them , it is the nature of the binary tree is as follows :

平衡二叉树：插入结点 在平衡二叉排序树BBST上插入一个新数据元素e 删除结点 删除结点过程与插入结点的操作类似，基本过程是：平衡二叉树，找到要删除的结点，删除一个结点，变成二叉树，旋转，变回平衡二叉树。 查找 把给定值与根结点作比较,若给定值大于根结点则查找其右子树,小于则查找其左子树,如此类推。 -Insertion node in the balanced binary sort tree BBST insert a new data element e remov

编制一个用二叉平衡树实现学生信息管理系统的程序，所有信息用文件保存。-Preparation of a balanced binary tree implementation with a student information management system procedures, all information is saved with the file.