对二叉树的生存,二叉树遍历等,有前序的,中序的,后序的,层次的,求结点数的等.

1．创建以二叉链表作存储结构的二叉树； 2．按前序遍历二叉树； 3．按中序遍历二叉树； 4．按后序遍历二叉树； 5．计算二叉树的单枝结点数； 6．按层次遍历二叉树。 -1. Create a list binary tree structure for storage 2. According to pre-order tree traversal 3. According to the binary tree traversal 4. After the tree

二叉树的前中后序遍历层次遍历，以及求节点数高度。求节点的父节点-Before, during and after the binary tree traversal hierarchy traversal, as well as the number of nodes required height. Find parent node

二叉树的层次遍历，执行后显示其执行过程，并显示其查找的点-Binary tree traversal level, showing its execution after execution, and displays its finding points