1. 建立自己的头文件BT.H，内容包括二叉链表的结构描述、二叉树的建立、二叉树的先序、中序与后序遍历算法。

2. 建立二叉树,并通过调用函数,，输出先序遍历、中序遍历与后序遍历的结果。

-1. To establish their own header files BT.H, including the structure of linked list binary descr iption of the establishment of binary tree, binary tree of the first order, in sequence and after the traversal algorithm. 2. The establishment of tree, and by calling the function, the output first traversal, in and after the traversal traversal results.