L2-006 树的遍历

//需要多看看 
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<stack>
#include<queue>
using namespace std;
const int maxn=1005;
int in_order[maxn],post_order[maxn];
int n;
int lch[maxn],rch[maxn],s[maxn];
queue<int> que;
int build_tree(int l1,int r1,int l2,int r2){
	if(l1>r1) return 0;
	int root=post_order[r2];
	int pos=l1;
	while(in_order[pos]!=root) pos++;
	int cnt=pos-l1;
	lch[root]=build_tree(l1,pos-1,l2,l2+cnt-1);
	rch[root]=build_tree(pos+1,r1,l2+cnt,r2-1);
	return root;
}
void BFS(int root){
	que.push(root);
	int i=0;
	while(!que.empty()){
		int node=que.front();
		que.pop();
		s[i++]=node;
		if(lch[node]) que.push(lch[node]);
		if(rch[node]) que.push(rch[node]);  
	} 
	for(int ii=0;ii<i;ii++){
		if(ii) cout<<" ";
		cout<<s[ii];
	}
}
int main(){
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	 scanf("%d",&post_order[i]); //后序遍历 
	for(int i=0;i<n;i++)
	 scanf("%d",&in_order[i]);//中序遍历
	int root=build_tree(0,n-1,0,n-1); 
	BFS(root);
	return 0;
}