1、实现动态查找表的三种基本功能：查找、插入、和删除。

2、初始，平衡二叉树为空树，操作界面给出查找、插入和删除三种操作供选择。每种操作均要提示输入关键字。每次插入或删除一个结点后，应更新平衡二叉树的显示。

3、平衡二叉树的显示采用树形结构显示二叉树。

4、合并两棵平衡二叉树。

5、把一棵平衡二叉树分裂为两棵平衡二叉树，使得在一棵树中的所有关键字都小于或等于x，另一棵树中的任一关键都大于x

-1, the dynamic lookup table of the three basic functions : Search, insert, and delete. 2, the initial, balanced binary tree is empty tree interface gives you, insert and delete operations for the three choices. Each operation will have to be me to input keywords. Each insert or delete a node, the update should show a balanced binary tree. 3, balanced binary tree shows that using the tree structure shown binary tree. 4, merging two balanced binary tree. 5, a balanced binary tree split into two balanced binary tree. made in a tree all the keywords are less than or equal to x, another one of the tree is better than a key x