二叉树 已知前序中序两个序列，建立二叉树（中序和后序也有）

本文主要讲二叉树的建树，具体的说就是，题目给出你二叉树的前序和中序，你来建树，还有一个题目是给出中序和后序来建树

第一题：A binary tree is a finite set of vertices that is either empty or consists of a root r and two disjoint binary trees called the left and right subtrees. There are three most important ways in which the vertices of a binary tree can be systematically traversed or ordered. They are preorder, inorder and postorder. Let T be a binary tree with root r and subtrees T1,T2.

In a preorder traversal of the vertices of T, we visit the root r followed by visiting the vertices of T1 in preorder, then the vertices of T2 in preorder.

In an inorder traversal of the vertices of T, we visit the vertices of T1 in inorder, then the root r, followed by the vertices of T2 in inorder.

In a postorder traversal of the vertices of T, we visit the vertices of T1 in postorder, then the vertices of T2 in postorder and finally we visit r.

Now you are given the preorder sequence and inorder sequence of a certain binary tree. Try to find out its postorder sequence.   

InputThe input contains several test cases. The first line of each test case contains a single integer n (1<=n<=1000), the number of vertices of the binary tree. Followed by two lines, respectively indicating the preorder sequence and inorder sequence. You can assume they are always correspond to a exclusive binary tree.
OutputFor each test case print a single line specifying the corresponding postorder sequence.
Sample Input

9
1 2 4 7 3 5 8 9 6
4 7 2 1 8 5 9 3 6

Sample Output

7 4 2 8 9 5 6 3 1

这个题的意思呢就是给出二叉树的前序和中序，要你求按 后序遍历来输出。

这道题对于初学二叉树的同学来说还是比较难的，对于完全摸不着头绪的同学，建议现在纸上根据两个序列来画出这个树，这一步很重要！！！因为通过画二叉树，你就会发现其中的规律，说白了就是 递归  ，当然，你要画很多个二叉树才能自己独立的写出完整的代码，我就是这样做的，感觉挺有效。

在这，我特意给了画二叉树的具体步骤，有助于大家理解。（见分析中的图片）

分析：

这个题最容易想到的就是先建树，然后再遍历输出，其实可以不用建树，直接输出，那么我分别讲一下两种解法。

第一种 ：建树，然后输出。

我们用两个数组把前序和中序存起来，便于查找。

我们知道，前序是 根-左-右，就是先输出根，再左子树，右子树，那么前序的第一个数一定是根，而中序遍历是 左 - 根 - 右 ， 根在中间， 那么根据前序来找根，用这个根的数据