实现二叉排序树维护子系统实现，实现查找、插入、删除、修改操作。首先要建立一棵二叉排序树，建立树根，然后按照中序遍历依次建立二叉排序树。运用switch的四个case实现各个操作，每个case中调用相应的子程序。子程序是选择要进行的操作：查找、插入、删除、修改。-Binary sort tree maintenance subsystem to achieve, to achieve the find, insert, delete, and modify operations. First necessary to establish a binary sort tree to establish roots, and then follow the traversal in order to establish the binary sort tree. Use four of the switch case each operation, the appropriate subroutine is called in each case. The subroutine is to select the operation to be carried out: find, insert, delete, modify.