二叉树是n（n>=0）个结点的有限集合，它或为空树，或是由一个称之为根的结点加上两棵分别称为左子树和右子树的互不相交的二叉树组成。

对二叉树的操作主要有：建立一棵二叉树；遍历二叉树；求二叉树的深度、结点数等。

1.　　定义二叉链表类型；

2.　　实现二叉树的基本操作：建立、先中后序遍历、层次遍历及输出。

-Binary Tree is n (n>　= 0) a finite set of nodes, it is empty or tree, or the root node, plus a so-called two trees are called the left subtree and right subtree are not mutually intersection of binary components. For binary operations are: the establishment of a binary tree　the binary tree traversal　binary tree of depth, and other nodes. 1. Define the type of binary list　2. To achieve binary tree basic operations: establishment, after the first traversal, traverse the level and output.