PAT (Advanced Level) Practice 1020 Tree Traversals

                                      1020 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.

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

AC代码：

#include<cstdio>
#include<queue>
using namespace std;
const int maxn = 31;
struct node{
	int data;
	node* lchild;
	node* rchild;
};
int N;
int post[maxn],in[maxn];
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(k = inL;k <= inR;k++){
		if(in[k]==post[postR]){
			break;
		}
	}
	//左子树结点个数 
	int numLeft =  k-inL;
	//左子树先序区间[preL+1,preL+numLeft],中序区间[inL,k-1]
	root->lchild = create(postL,postL+numLeft-1,inL,k-1); 
	//右子树先序区间[preL+numLeft+1,preR],中序区间[k+1,inR] 
	root->rchild = create(postL+numLeft,postR-1,k+1,inR);
	//返回根结点地址 
	return root;
} 
int num=0;
void LayerOrder(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);
	LayerOrder(root);
	return 0;
	 
}