1．建立二叉链表。

要求：按先序遍历规则，从键盘连续输入二叉树的先序序列，若无孩子结点，则用*代替，以示空指针的位置。

2．用先序、后序遍历递归算法对前面建立好的二叉链表树进行遍历。要求分别显示遍历后的结点序列。

3．调用计算二叉树的叶子结点算法，统计上述二叉链表树的叶子结点总数，从屏幕显示二叉链表树的叶子结点总数。

4．设计一个算法，求二叉树中值为x的结点的所在层的层号。

-1. The establishment of binary list.

Requirements: preorder traversal according to the rules of binary continuous input from the keyboard of the first-order sequence, without the child node, then instead of using* to show the location of a null pointer.

2. First-order, postorder recursive algorithm to the list in front of the establishment of good binary tree traversal. Requests were displayed after the node traversal sequence.

3. Call calculated the leaf nodes binary tree algorithm is, statistics list the above-mentioned binary tree, the total number of leaf nodes from the screen display binary tree list the total number of leaf nodes.

4. Design an algorithm, seeking value in a binary tree node x, the layer where the layer number.