1．输入字符序列，建立二叉链表。

2．中序遍历二叉树:递归算法。

3．中序遍历二叉树:非递归算法。

4．求二叉树的高度。

5．求二叉树的叶子个数。

6．试编写交换以二叉链表作存储结构的二叉树中所有结点的左、右子树的算法。

7．建立中序线索二叉树，并实现中序遍历。

-1. Input sequence of characters, the establishment of binary list.

2. Inorder traversal binary tree: recursive algorithm.

3. Inorder traversal binary tree: non-recursive algorithm.

4. Binary tree of height requirements.

5. Request the number of binary tree leaves.

6. Prepared to test the exchange of binary linked list storage structure of the binary tree for all nodes left and right sub-tree algorithms.

7. Threaded binary tree in order to establish and achieve in order traversal.