Tree

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=10010;
int inv[maxn],pt[maxn],lt[maxn],rt[maxn];
int n;
int read_list(int *a)
{
	string line;
	if(!getline(cin,line))
	 return 0;
	 stringstream ss(line);
	 n=0;
	 int x;
	 while(ss>>x) a[n++]=x;
	 return n>0;
}
int build(int l1,int r1,int l2,int r2)
{
	if(l1>r1)
	 return 0;
    int root=pt[r2];
    int p=l1;
    while(inv[p]!=root)
      p++;
    int cnt=p-l1;
    lt[root]=build(l1,p-1,l2,l2+cnt-1);
    rt[root]=build(p+1,r1,l2+cnt,r2-1);
    return root;
}
int best_sum,best;
void dfs(int u,int sum)
{
	sum+=u;
	if(!lt[u]&&!rt[u])
	{
		if(sum<best_sum||(sum==best_sum&&u<best))
		{
			best=u;
			best_sum=sum;
		}
	 } 
	if(lt[u])
	  dfs(lt[u],sum);
	if(rt[u])
	  dfs(rt[u],sum);
}   
int main()
{
	while(read_list(inv))
	{
		read_list(pt);
		build(0,n-1,0,n-1);
		best_sum=1000000000;
		dfs(pt[n-1],0);
		cout<<best<<"\n";
	}
 }