本程序用二叉树类实现了从键盘输入二叉树的两种遍历结果，在内存中建立二叉链表，根据遍历结果恢复该二叉树，并在屏幕上显示该二叉树。整个程序采用多文件，一个头文件，一个函数实现文件，以及主函数所在文件。-The program uses a binary tree class implements a binary tree from two keyboard traversal results in memory to create the

该程序为二叉树节点编辑系统，由四部分组成：插入节点，寻找节点，删除结点和恢复到默认设置。-This is a BSTree2 edit program, mainly contains four parts: insert a node, find a node, delete a node and restore default settings.

从键盘输入二叉树的两种遍历结果，在内存中建立二叉链表，根据遍历结果恢复该二叉树，并在屏幕上显示该二叉树。-Binary list results from two keyboard input binary tree traversal, memory, and restore the binary tree traversal results, and the binary tree is displayed on the scree

输入二叉树两种遍历结果（中序加另外一种），恢复该二叉树。-Input binary tree the two traversal results (in sequence plus another) to restore the binary tree.