1020 Tree Traversals (25分)

1020 Tree Traversals (25分)

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 <algorithm>
#include<vector>
#include<map>
#include<string>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<set>
#include<unordered_map>
#include<queue>
#include<climits>
using namespace std;
const int maxn= 10000+5;

int post[maxn],in[maxn];

struct Node{
	int id;
	int value;	
};
vector<Node>ans;
bool cmp(Node a,Node b){
	return a.id<b.id;
	
};

void pre(int root,int start,int end,int id){
	if(start>end) return;
	int i=start;
	while(i<end&&in[i]!=post[root])i++;
	ans.push_back({id,post[root]});
	pre(root-end+i-1,start,i-1,2*id+1);
	pre(root-1,i+1,end,2*id+2);
	
}



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];
		pre(n-1,0,n-1,0);
		
		sort(ans.begin(),ans.end(),cmp);
		cout<<ans[0].value;
		for(int i=1;i<=n-1;i++) cout<<" "<<ans[i].value;

    return 0;
}