说明：  完成以下菜单项功能，要求执行完一个功能后自动输出二叉链表的广义表形式或凹入形式： 按带空子树的前序序列建树； 输出前序、中序、后序遍历序列（递归算法）； 输出结点个数、叶子结点个数； 输出二叉树的深度； 按凹入格式输出二叉树； 按广义表格式输出二叉树； 查询前序遍历序列的第i个结点； 一般二叉树的查找：给定值是否在二叉树中； 建立二叉排序树； 二叉排序树的查找。 使用二叉排序树完成排序。
(Complete the following menu items feature that requires a function executed automatically after the output of the generalized binary linked list or recess in the form of tables in the form: according to the tree with the empty sequence of the first order contribution output pre-order, in sequence, after traversing sequence (recursive algorithm ) output node number, the number of leaf nodes output binary tree of depth binary format output by indentation table format output by the generalized binary tree check order traversal sequence before the first i nodes general binary tree search: whether a given value of the binary tree create binary sort tree binary search tree sort. Complete binary tree using the sort order.)