二叉树的基本操作，

1．以二叉链表表示二叉树，建立一棵二叉树

2．输出二叉树的前序遍历结果

3．输出二叉树的中序遍历结果

4．输出二叉树的后序遍历结果

5．统计二叉树的结点个数

6．统计二叉树的叶结点个数

7．计算二叉树的深度

-Binary Tree s basic operations, 1. List said in binary tree, the establishment of a tree 2. Bintree output the results of the first traversal 3. Output binary tree traversal results in 4. After the output of the binary tree traversal results 5. Statistics tree node number 6. Statistics tree leaf node number 7. Calculation of the depth of binary tree