1127 ZigZagging on a Tree (30 分)

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

==根据中序遍历和后序遍历建树，tree[index][0]存放的是后序遍历中索引为index的节点的左子节点在后序遍历中的索引，ree[index][1]存放的是后序遍历中索引为index的节点的右子节点在后序遍历中的索引，然后通过bfs将每一层的节点数据存到对应的result[i]中，i从0开始,偶数层从右往左遍历，寄数层从左往右遍历 ==

#include<bits/stdc++.h>
using namespace std;
struct node{
	int index, level;
};
int tree[35][2];
unordered_map<int, int> m;
vector<int> in, post, result[35];
void dfs(int &index, int inL, int inR, int postRoot) {
	if (inL > inR) return ;
	int inRoot = m[post[postRoot]];
	index = postRoot;
	dfs(tree[index][0], inL, inRoot - 1, postRoot - (inR - inRoot + 1));
	dfs(tree[index][1], inRoot + 1, inR, postRoot - 1);
}
void bfs(int root) {
	queue<node> q;
	q.push(node{root, 0});
	while (!q.empty()) {
		node temp = q.front();
		q.pop();
		result[temp.level].push_back(post[temp.index]);
		if (tree[temp.index][0] != 0) q.push(node{tree[temp.index][0], temp.level + 1});
		if (tree[temp.index][1] != 0) q.push(node{tree[temp.index][1], temp.level + 1});
	}
	printf("%d", result[0][0]);
	for (int i = 1; i < 35 && result[i].size() > 0; i++) {
		if (i % 2 == 0) {
			for (int j = result[i].size() - 1; j >= 0; j--) {
				printf(" %d", result[i][j]);
			}
		} else {
			for (int j = 0; j < result[i].size(); j++) {
				printf(" %d", result[i][j]);
			}
		}
	}
}
int main() {
	int n, root;
	scanf("%d", &n);
	in.resize(n + 1);
	post.resize(n + 1);
	for (int i = 1; i <= n; i++) {
		scanf("%d", &in[i]);
		m[in[i]] = i;
	}
	for (int i = 1; i <= n; i++) {
		scanf("%d", &post[i]);
	}
	dfs(root, 1, n, n);
	bfs(root);
	
}