PAT-A1020 TreeTraversals

#include<cstdio>
#include<cstring>
#include<queue>
#include<algorithm>

using namespace std;

const int maxn = 50;
struct node{
	int data;
	node* lchild;
	node* rchild; 
};

int pre[maxn], in[maxn], post[maxn];
int n;

node* create(int postL, int postR, int inL, int inR){
	if(postL > postR){
		return NULL;	//后序序列长度小于等于0时，直接返回	 
	}
	
	node* root = new node;	//新建一个新的结点，用来存放当前二叉树的根结点 
	root->data = post[postR];
	
	int k;
	for(k = inL; k <= inR; k++){
		if(in[k] == post[postR]){	//在中序序列中找到根结点 
			break;
		}
	}
	
	int numLeft = k - inL;	//左子树的结点个数
	
	root->lchild = create(postL, postL + numLeft - 1, inL, k - 1);
	root->rchild = create(postL + numLeft, postR - 1, k + 1, inR);
	
	return root;
}

int num = 0;	//已输出的结点个数 

void BFS(node* root){
	queue<node*> q;
	q.push(root);
	while(!q.empty()){
		node* now = q.front();
		q.pop();
		printf("%d", now->data);
		num++;
		if(num < n) printf(" ");
		if(now->lchild != NULL)	q.push(now->lchild);
		if(now->rchild != NULL)	q.push(now->rchild);		
	}
}

int main(){
	scanf("%d", &n);
	for(int i = 0; i < n; i++){
		scanf("%d", &post[i]);
	}
	for(int i = 0; i < n; i++){
		scanf("%d", &in[i]);
	}
	
	node* root = create(0, n - 1, 0, n - 1);
	BFS(root);

	return 0;
}