A1020 Tree Traversals

简单题，就是后序遍历+中序遍历重建二叉树。然后输出层序遍历。

#include <stdio.h>
#include <queue>
using namespace std;

const int N = 35;
int post[N],in[N];

struct node{
	int data;
	node *left,*right;
};

node *Create(int postL,int postR,int inL,int inR)
{
	if(postL>postR)return NULL;
	node *root = new node;
	root->data = post[postR];
	int k;
	for(int i=inL;i<=inR;i++){
		if(in[i] == post[postR]){
			k = i;
			break;
		}
	}
	int numLeft = k-inL;		//左子树节点个数
	root->left = Create(postL,postL+numLeft-1,inL,k-1);
	root->right = Create(postL+numLeft,postR-1,k+1,inR);
	return root;
}
void PrintLevel(node* root)	//层序遍历
{
	queue <node*> q;		//注意队列里面存的是地址
	q.push(root);
	int flag = 0;
	while(!q.empty()){
		node* temp = q.front();
		q.pop();
		if(flag)printf(" ");
		flag = 1;
		printf("%d",temp->data);
		if(temp->left)q.push(temp->left);
		if(temp->right)q.push(temp->right);
	}
}
int main(int argc, char const *argv[])
{
	int n;
	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);
	PrintLevel(root);
	return 0;
}