PAT1020 Tree Traversals

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.

#include<iostream>
#include<queue>
#include<vector>
using namespace std;
int n;
int post[39];
int in[39];
vector<int> v; 
struct node{
	int value;
	node* lchild;
	node* rchild;
};
node* create(int postL,int postR,int inL,int inR){
	if(postL>postR) return NULL;
	node* root=new node;
	root->value=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;
}
void LayerOrder(node* root){
	queue<node*> q;
	q.push(root);
	while(!q.empty()){
		node* now=q.front();
		q.pop();
		v.push_back(now->value);
		if(now->lchild!=NULL) q.push(now->lchild);
		if(now->rchild!=NULL) q.push(now->rchild);
	}
}
int main(){
	cin>>n;
	for(int i=1;i<=n;i++) cin>>post[i];
	for(int i=1;i<=n;i++) cin>>in[i];
	node* root=create(1,n,1,n);
	LayerOrder(root);
	for(int i=0;i<v.size();i++) printf("%d%s",v[i],i==v.size()-1?"\n":" ");
	return 0;
} 

通过这个题我大致学会了前序中序或后序中序创建一棵树，以及层序遍历一棵树。