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

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

（3）中序遍历二叉树:非递归算法。（最好也能实现先序，后序非递归算法）

（4）求二叉树的高度 。

（5）求二叉树的叶子个数。

（6）建立中序线索二叉树，并实现中序遍历。

（8）借助队列实现二叉树的层次遍历。

（9）在主函数中设计一个简单的菜单，分别调试上述算法。-(1) Enter the character sequence of binary list. (2) in traversing Binary: recursive algorithm. (3) in traversing Binary: non-recursive algorithm. (Best to achieve the first-order, post-order non-recursive algorithm) (4) Find the height of the binary tree. (5) Find the number of leaves of a binary tree. (6) to establish inorder threaded binary and achieve the in-order traversal. (8) by means of the queue level traversal of a binary tree. (9) to design a simple menu in the main function, respectively commissioning of the above algorithm.