1.基本训练

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

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

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

（4）求二叉树的高度 。

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

（6）对于树中每一个元素值为x的结点，删去以它为根的子树，并释放相应的空间。

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

（9）在主函数中设计一个简单的菜单，分别调试上述算法。

-Basic Training (1) Enter the character sequence, establish binary list. (2) The first sequence, sequence, after traversing Binary: recursive algorithm. (3) in traversing Binary: non-recursive algorithm (best to achieve the first-order, post-order non-recursive algorithm). (4) Determine the height of the binary tree. (5) Find the number of leaves of a binary tree. (6) For each element in the tree node value of x, by deleting sub-tree root, and the release of the corresponding space. (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.