UVA_548: Tree

Description

You are to determine the value of the leaf node in a given binary tree that is the terminal node of a path of least value from the root of the binary tree to any leaf. The value of a path is the sum of values of nodes along that path.

Input 

The input file will contain a description of the binary tree given as the inorder and postorder traversal sequences of that tree. Your program will read two line (until end of file) from the input file. The first line will contain the sequence of values associated with an inorder traversal of the tree and the second line will contain the sequence of values associated with a postorder traversal of the tree. All values will be different, greater than zero and less than 10000. You may assume that no binary tree will have more than 10000 nodes or less than 1 node.

Output 

For each tree description you should output the value of the leaf node of a path of least value. In the case of multiple paths of least value you should pick the one with the least value on the terminal node.

Sample Input 

3 2 1 4 5 7 6
3 1 2 5 6 7 4
7 8 11 3 5 16 12 18
8 3 11 7 16 18 12 5
255
255

Sample Output 

1
3
255

分析：后序遍历的第一个字符是根，因此只需要在中序遍历中找到它，就知道左右子树的中序和后序遍历了。这样可以先把二叉树构造出来，然后再递归遍历，找到最优解。

#include <iostream>
#include <string>
#include <sstream>
#include <algorithm>

using namespace std;

//因为各个结点的权值各不相同且都是整数，直接用权值作为结点编号
const int maxn = 10000 + 10;
int in_order[maxn], post_order[maxn], lch[maxn], rch[maxn];
int n;

bool read_list(int* a){
	string line;
	if(!getline(cin, line)) return false;
	stringstream ss(line);
	n = 0;
	int x;
	while(ss>>x) a[n++] = x;
	return n > 0;
}

//把in_order[L1..R1]和post_order[L2..R2]建成一颗二叉树，返回树根
int build(int L1, int R1, int L2, int R2){
	if(L1 > R1) return 0;
	int root = post_order[R2];
	int p = L1;
	while(in_order[p]!=root) p++;
	int cnt = p-L1;
	lch[root] = build(L1, p-1, L2, L2+cnt-1);
	rch[root] = build(p+1, R1, L2+cnt, R2-1);
	return root;
}

int best, best_sum; //当前最优解和对应权值和

void dfs(int u, int sum){
	sum += u;
	if(!lch[u] && !rch[u]) {
		if(sum < best_sum || (sum==best_sum && u<best)){
			best = u; best_sum = sum;
		}
	}
	if(lch[u]) dfs(lch[u], sum);
	if(rch[u]) dfs(rch[u], sum);
}

int main()
{
	while(read_list(in_order)) {
		read_list(post_order);
		build(0, n-1, 0, n-1);
		best_sum = 0x3f3f3f3f;
		dfs(post_order[n-1], 0);
		cout << best << endl;
	}
    return 0;
}