二叉树操作实例，包括 1 建立二叉树 2 先序非递归遍历 3 中序递归遍历 4 后序递归遍历，求叶节点数 5 删除节点 6 结束程序运行 等操作。输入数字1~6，选择以上6种操作。-Examples of binary operations, including the establishment of a binary tree two first order non-recursive inorder traversal three recursive postorder traversal four recursive traversal, seek leaf nodes 5 nodes 6 to delete the end of program is running such an operation. Enter a number from 1 to 6, select the above six kinds of operations.