# 1020. Tree Traversals (25)

400 ms

65536 kB

16000 B

Standard

CHEN, Yue

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<iostream>
#include<queue>
#define MAX 30
using namespace std;
struct bitree{
int data;
bitree *left;
bitree *right;
};
int in[MAX] = {0}, post[MAX] = {0};
int layer[MAX] = {0};
int cnt;
bitree *creat(int inL, int inR, int postL, int postR)
{
if(postL > postR){
return NULL;
}
bitree *root = new bitree;
root->data = post[postR];
int i;
for(i = inL; i <= inR; i++){
if(in[i] == post[postR]){
break;
}
}
int numL = i - inL;
root->left = creat(inL, i - 1, postL, postL + numL - 1);
root->right = creat(i + 1, inR, postL + numL, postR - 1);
return root;
}
void layerorder(bitree *root)
{
queue<bitree *> q;
q.push(root);
while(!q.empty()){
bitree *top = q.front();
q.pop();
layer[cnt++] = top->data;
if(top->left != NULL){
q.push(top->left);
}
if(top->right != NULL){
q.push(top->right);
}
}
}
int main()
{
int n;
cin >> n;
for(int i = 0; i < n; i++){
cin >> post[i];
}
for(int i = 0; i < n; i++){
cin >> in[i];
}
bitree *root = creat(0, n - 1, 0, n - 1);
layerorder(root);
for(int i = 0; i < cnt; i++){
if(i != cnt - 1){
cout << layer[i] << ' ';
}else{
cout << layer[i] << endl;
}
}
return 0;
}