以二叉链表作为存储结构

由用户输入一棵二叉树

使用菜单界面

分别输出二叉树的先序、中序和后序遍历下的结点访问次序

输出二叉树的深度

输出二叉树中所有的叶子结点及其数目。-Linked list to binary storage structure from user input as a binary tree binary tree using the menu interface, the output of the first order, respectively, in the order and post order traversal visits the nodes under the order of the depth of the output binary output in binary All the leaf nodes and the number.