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 tre

建立一棵二叉树，用二叉链表存储二叉树，计算二叉树中包含的结点个数-A binary tree, using the the binary list stored binary tree to calculate the number of nodes in a binary tree contains

用下面两种方法中的任一种建立y一棵n层的满二叉树。 (1) 按先序遍历递归调用建立链式满二叉树； (2) 按层序遍历二叉树方式建立链式满二叉树。 （3）把二叉树得凹入表示法打印出来 -Use either of the following two methods to establish a y a n-tier full binary tree. (1) according to preorder a recursive call to establish a chain fu

对所建立的二叉树用递归和非递归的中序遍历输出树的结点的算法。-Established algorithm for binary output node of the tree using recursive and non-recursive preorder.