1138 Postorder Traversal (25分)

Suppose that all the keys in a binary tree are distinct positive integers. Given the preorder and inorder traversal sequences, you are supposed to output the first number of the postorder 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 (≤ 50,000), the total number of nodes in the binary tree. The second line gives the preorder 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 first number of the postorder traversal sequence of the corresponding binary tree.

先序遍历顺序是：左子树 根 右子树

后序遍历顺序是：根 左子树 右子树， 所以只要在先序序列中找到第一个非根节点，就是后序序列中的第一个节点了。

#include<iostream>
#include<unordered_map>
const int maxn = 50010;
using namespace std;
unordered_map<int, int>pos;
int n, pre[maxn], in[maxn];
int ans(int pres, int pree, int ins, int ine) {//先序的查找区间和中序的查找区间
	if (pres==pree)return pre[pres];
	if (pres < pree) {
		int pos = ins;
		for (; pos <= ine; pos++)
			if (in[pos] == pre[pres])
				break;
		if (pos == ins)return ans(pres + 1, pres + ine - ins, ins + 1, ine);//无左子树
		else if (pos == ine)return ans(pres + 1, pres + ine - ins, ins, ine - 1);//无右子树
		else
			return ans(pres + 1, pres + pos - ins, ins, pos - 1);
	}
}
int main() {
	cin >> n;
	for (int i = 0; i < n; i++) cin >> pre[i];
	for (int i = 0; i < n; i++) cin >> in[i];
	cout << ans(0, n - 1, 0, n - 1) << endl;
	return 0;
}

发现pat里与遍历序列有关的题目大多不需要建树，挺有意思的。