1127. ZigZagging on a Tree (30)

最新推荐文章于 2021-10-17 22:24:53 发布

石前有座桥

最新推荐文章于 2021-10-17 22:24:53 发布

阅读量272

点赞数 1

分类专栏： PAT甲级（二刷）

本文链接：https://blog.csdn.net/lyw_321/article/details/79438960

版权

PAT甲级（二刷）专栏收录该内容

142 篇文章 1 订阅

订阅专栏

1127. ZigZagging on a Tree (30)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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<vector>
using namespace std;
int deepest;
vector<int>cou[35];
typedef struct Node *node;
struct Node{
	int depth;
	int x;
	node left;
	node right;
};
int in[35],post[35];
node build(int s1,int e1,int s2,int e2,int depth){
	node T=(node)malloc(sizeof(struct Node));
	T->x=post[e2];
	T->depth=depth;
	T->left=T->right=0;
	cou[depth].push_back(T->x);//存储每一层高度对应结点 
	if(depth>deepest){
		deepest=depth;
	}
	int root,i;
	for(i=s1;i<=e1;i++){
		if(in[i]==post[e2]){
			root=i;break;
		}
	}
	if(root!=s1){
		T->left=build(s1,root-1,s2,root-s1+s2-1,depth+1);
	}
	if(root!=e1){
		T->right=build(root+1,e1,root-s1+s2,e2-1,depth+1);
	}
	return T;
}
int main(){
	int n,i,j;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d",&in[i]);
	}
	for(i=0;i<n;i++){
		scanf("%d",&post[i]);
	}
	node T=0;//NULL
	T=build(0,n-1,0,n-1,1);
	printf("%d",T->x);
	for(i=2;i<=deepest;i++){//行数分奇偶输出 
		if(i%2){
			for(j=cou[i].size()-1;j>=0;j--){
				printf(" %d",cou[i][j]);
			}
		}
		else{
			for(j=0;j<cou[i].size();j++){
				printf(" %d",cou[i][j]);
			}
		}
	}
}