pat根据中序遍历和先序遍历_PAT A1020——已知后序中序遍历求层序遍历

Suppose that all the keys in a binary tree are distinct positive integers. Given the postorder and inorder traversal sequences, you are supposed to output the level order traversal sequence of the corresponding binary tree.

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer N (≤30), the total number of nodes in the binary tree. The second line gives the postorder sequence and the third line gives the inorder sequence. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print in one line the level order traversal sequence of the corresponding binary tree. All the numbers in a line must be separated by exactly one space, and there must be no extra space at the end of the line.

Sample Input:

7

2 3 1 5 7 6 4

1 2 3 4 5 6 7

Sample Output:

4 1 6 3 5 7 2

#include#include#include#include

using namespacestd;const int maxn = 50;structnode {intdata;

node*lchild;

node*rchild;

};int pre[maxn],in[maxn],post[maxn]; //先序、中序及后序

int n; //结点个数//当前二叉树的后序序列区间为[postL,postR],中序序列区间为[inL,inR]//create函数返回构建出的二叉树的根节点地址

node* create(int postL, int postR, int inL, intinR) {if(postL >postR) {return NULL; //若后序序列长度小于等于0，则直接返回

}

node* root = new node; //新建一个新的结点，用来存取当前二叉树的根节点

root->data = post[postR]; //新结点的数据域为根节点的值

intk;for(k = inL; k <= inR; k++) {if(in[k] == post[postR]) { //在中序序列中找到in[k] == pre[L]的结点

break;

}

}int numLeft = k - inL; //左子树的结点个数//返回左子树的根节点地址，赋值给root的左指针

root->lchild = create(p