1127 ZigZagging on a Tree（30 分）

Suppose that all the keys in a binary tree are distinct positive integers. A unique binary tree can be determined by a given pair of postorder and inorder traversal sequences. And it is a simple standard routine to print the numbers in level-order. However, if you think the problem is too simple, then you are too naive. This time you are supposed to print the numbers in "zigzagging order" -- that is, starting from the root, print the numbers level-by-level, alternating between left to right and right to left. For example, for the following tree you must output: 1 11 5 8 17 12 20 15.

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 inorder sequence and the third line gives the postorder sequence. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print the zigzagging sequence of the tree in a line. 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:

8
12 11 20 17 1 15 8 5
12 20 17 11 15 8 5 1

Sample Output:

1 11 5 8 17 12 20 15

#include<iostream>
#include<fstream>
#include<queue>
#include<vector>
using namespace std;
const int maxn=50;

struct node{
	int data;
	node* lchild;
	node* rchild;
	int layer;
};

int in[maxn], post[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;
	root->lchild=create(postl, postl+numleft-1, inl, k-1);
	root->rchild=create(postl+numleft, postr-1, k+1, inr);
	return root;
}
vector<int> v[maxn];
void bfs(node* root){
	queue<node*> q;
	q.push(root);
	root->layer=1;
	while(!q.empty()){
		node* now=q.front();
		q.pop();
		v[now->layer].push_back(now->data); 
		if(now->lchild != NULL) {
			now->lchild->layer=now->layer+1;
			q.push(now->lchild);
		}
		if(now->rchild != NULL){
			now->rchild->layer=now->layer+1;
			q.push(now->rchild);  
		}  
	}
}
int main(){
	int n;
//	freopen("d://in.txt", "r", stdin);
	scanf("%d", &n);
	for(int i=0; i<n; i++){
		scanf("%d", &in[i]);
	}
	for(int i=0; i<n; i++){
		scanf("%d", &post[i]);
	}
	node* root=create(0, n-1, 0, n-1);
	bfs(root);
	int count=0;
	for(int i=1; i<=n; i++){
			if(i%2==0){
				for(int j=0; j<v[i].size(); j++){
					printf("%d", v[i][j]);
					count++;
					if(count!=n) printf(" ");
				}
			} else {
				for(int j=v[i].size()-1; j>=0; j--){
					printf("%d", v[i][j]);
					count++;
					if(count!=n) printf(" ");			
			}
		}
		if(count==n) break;
	}
	return 0;
}