说明：二叉树操作：建立二叉树，前序遍历二叉树、中序、后序遍历二叉树。
Binary tree operation: create a binary tree, before traversing binary, inorder, postorder binary tree traversal.
对二叉树的遍历过程进行深入地研究，提出一种生成二叉树遍历序列的新方法，解决了二叉树遍历序列的生成问题。
By careful researches of the traversal of binary tree, a new method of traversing binary tree is brought forward, which is able to solve the problem of traversal of binary tree.
本文将对满二叉树的结构进行深入分析，采用深度遍历与广度遍历两种途径给出递推关系式。
This paper goes deeply into such tree's structure using both depth search and breadth search, and gives recursive relationship separately.
应用推荐