PAT-1127 ZigZagging on a Tree

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<stdio.h>
#include<stdlib.h>
#include<queue>
#include<vector>
#include<algorithm>
using namespace std;

int in[35];
int post[35];
int n;
typedef struct node{//树节点
	int v;
	node *left,*right;
}node;
node* tree;
vector<int> level;//用于层序输出
node* newnode(int v){
	node *nd=(node*)malloc(sizeof(node));
	nd->v=v;
	nd->left=NULL;
	nd->right=NULL;
	return nd;
}
void build(int b1,int e1,int b2,int e2,node* root,bool isleft){//递归建树
	if(e1<b1) return ;
	int rootv=post[e2];
	node* nd=newnode(rootv);
	if(root==NULL)
		tree=nd;
	else{
		if(isleft)
			root->left=nd;
		else
			root->right=nd;
	}
	int inr=b1;
	for(;in[inr]!=rootv;inr++)
		;
	int lchnum=inr-b1;
	build(b1,inr-1,b2,b2+lchnum-1,nd,true);//left
	build(inr+1,e1,b2+lchnum,e2-1,nd,false);//right
}
void print(bool isLR){//正反序输出
	if(isLR){
		for(int i=0;i<level.size();i++){
			if(level[i]!=tree->v)printf(" ");
			printf("%d",level[i]);
		}
	}else{
		for(int i=level.size()-1;i>=0;i--){
			if(level[i]!=tree->v)printf(" ");
			printf("%d",level[i]);
		}
	}
}
int main(){
	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);
	}
	build(0,n-1,0,n-1,NULL,true);//建树
	queue<node> q;
	q.push(*tree);
	int tag=tree->v;bool pre,lr=true;
	while(!q.empty()){
		node t=q.front();
		q.pop();
		if(tag==t.v){
			pre=true;
			print(lr);//输出上一层
			lr=!lr;
			level.clear();
		}
		level.push_back(t.v);

		if(t.left!=NULL){
			if(pre){
				pre=false;
				tag=t.left->v;
			}
			q.push(*t.left);
		}
		if(t.right!=NULL){
			if(pre){
				pre=false;
				tag=t.right->v;
			}
			q.push(*t.right);
		}
	}
	print(lr);

	return 0;
}