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.
对二叉树的遍历过程进行深入地研究，提出一种生成二叉树遍历序列的新方法，解决了二叉树遍历序列的生成问题。
Given preorder and inorder traversal of a tree, construct the binary tree.
给定一个二叉树的前序和中序遍历，重建这棵二叉树。
Given a sequence of binary trees, you are to write a program that prints a level-order traversal of each tree.
给定一个二叉树序列，你要写一个程序将每棵树按层序访问并打印出来。
应用推荐