1.实现二叉树的下列运算:

[1]输入一个二叉树的先序序列，生成二叉树的二叉链表

[2]显示其先序、中序和后序遍历结果。

[3]计算二叉树的叶子结点数。

[4]求二叉树的深度

2.编程实现二叉树的层次遍历

3.哈夫曼编码-1.operational binary tree:

[1] Enter a first sequence binary tree sequence, generating a binary tree binary list

[2] show its first order, sequence and after preorder results.

[3] calculated binary tree leaf nodes.

[4] binary tree of depth

2. Programming level binary tree traversal

3. Huffman coding