AVL树实现高效查找，平衡二叉树，随结点加入而旋转，始终保证树的平衡性，资料中是该树的所有文件（包含debug）-Efficient search AVL tree, balanced binary rotation as nodes join and always ensure that the balance of the tree, the tree of all files (including debug information)

1、实现折半查找算法 2、实现二叉排序树的建立、查找和删除 -1, to achieve the bisearch algorithm 2, the establishment of two fork sort tree, find and delete