说明：二叉树操作：建立二叉树，前序遍历二叉树、中序、后序遍历二叉树。
Binary tree operation: create a binary tree, before traversing binary, inorder, postorder binary tree traversal.
给定一个二叉树的前序和中序遍历，重建这棵二叉树。
Given preorder and inorder traversal of a tree, construct the binary tree.
但是不同的二叉树的先序遍历序列或中序遍历序列或后序遍历序列有可能是相同的。
The pre order, in order and post order traversal of every binary tree are unique, but those of different binary trees may be identical.
利用递归和非递归实现二叉树的中序遍历，利用队列实现二叉树的层次遍历。
Recursive and non recursive implementation of binary tree traversal, the use of queues to achieve the level of binary tree traversal.
给定先序和中序遍历，构造二叉树。
Given preorder and inorder traversal of a tree, construct the binary tree.
给定先序和中序遍历，构造二叉树。
Given preorder and inorder traversal of a tree, construct the binary tree.
应用推荐