程序实现二叉树结点的类型定义和对二叉树的基本操作。该程序包括二叉树结构类型以及每一种操作的具体的函数定义和主函数。

1.先序次序建立一个二叉树 ，用#表示某结点的左右子树是否为空，用于表示该结点是否为叶子或者可能存在左子树or右子树。例如对一个简单的三节点二叉树，节点b和c分别为根节点a的左孩子和右孩子，用先序来创建就表示为ab##c##

2.按先序、中序、后序、层次遍历分别输出二叉树的所有节点

3.求二叉树中所有节点数

4.求二叉树的深度 -Program binary tree node type definitions and basic operation of the binary tree. The program includes a binary tree structure and the specific type of function definitions and the main function of each operation. 1 preorder order to create a binary tree, with the# indicates whether a node is about sub-tree is empty, indicating whether the node is a leaf or there may be left subtree or right subtree. For example for a simple three-node binary tree, the nodes b and c are the root of a left child and right child, with the first order to create it means is ab## c## 2. According to first order, in sequence after sequence, 3 Find all the nodes are output levels of the binary tree binary tree traversal of all nodes 4 binary tree of depth