二叉树的操作

1.先序创建二叉树

2.中序递归遍历二叉树

3.先序非递归遍历二叉树

4.中序非递归遍历二叉树

5.后序非递归遍历二叉树

6.层次遍历二叉树

7.求二叉树的高度

8.求二叉树叶子数

9.退出程序-Binary operation 1. The first order to create a binary tree 2. In order recursive binary tree traversal 3. Preorder traversal non-recursive binary tree 4. In order traversal non-recursive binary tree 5. After the second order non-recursive traversal Tree 6. Level 7 traversing a binary tree. demand a high degree of binary tree 8. seek a binary tree leaf number 9. exit