UVA548——Tree(中后序建树+DFS)

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

题目大意：

　　　　输入一个二叉树的中序和后序，输出一个叶子节点，该叶子节点到根的数值总和最小。

解题思路：

　　　　先通过后序和中序建立二叉树，在通过DFS进行搜索，找到符合题目要求的叶子。（需要使用全局变量来记录DFS过程中的最小和叶子）

　　　　中序和后序建立二叉树：

　　　　　　使用递归来逐步建立，由后序连确定当前递归中的分支的根节点，再在中序中找到根的位置，则中序中根左的为左子树的中序排列，根右的为右子树的中序。设此时左子树的长度为len，则当前的后序的前len个数据是左子树的后序排列。同理进行递归即可。右子树同理。

　　　　DFS：

　　　　　　设一个变量m，每次递归时作为实参进入调用，并执行m+=tree.data，则能保证递归到叶子节点时，m保存的是当前叶子到根节点的和，根据m的大小，即可选出符合题意的叶子节点。

Code：

 #include<malloc.h>
 #include<iostream>
 #include<stdio.h>
 #include<string>
 #include<cstring>
 using namespace std;
 struct tree
 {
     int data;
     int left;
     int right;
 } T[]; //数组模拟的二叉树
 int m_sum=,pos; //用于DFS时保存结果
 int mid[],last[];
 int create_tree(int m1,int m2,int l1,int l2)
 {
     if (m1==m2)
     {
         T[m1].left=T[m1].right=-;
         T[m1].data=mid[m1];
         return m1;
     }
     if (m1>m2)
         return -;
     int i;
     for (i=; i<=m2; i++)
         if (mid[i]==last[l2]) break;
     T[i].left=create_tree(m1,i-,l1,l1+i-m1-);//递归建树！！注意四个参数，runtime好多遍
     T[i].right=create_tree(i+,m2,l1+i-m1,l2-);
     T[i].data=mid[i];
     return i;
 }
 int min(int a,int b)
 {
     return a>b?b:a;
 }
 int dfs(int head,int m)
 {
     m+=T[head].data;
     if (T[head].left==-&&T[head].right==-)
     {
         if (m<m_sum) //打擂台，选出最小的结果，并将叶子节点的数值存入pos中
         {
             m_sum=m;
             pos=T[head].data;
         }
         return T[head].data;
     }
     int sum=T[head].data;
     if (T[head].left!=-&&T[head].right==-) sum+=dfs(T[head].left,m);
     else if (T[head].right!=-&&T[head].left==-) sum+=dfs(T[head].right,m);
     else sum+=min(dfs(T[head].left,m),dfs(T[head].right,m));
     return sum;
 }
 int main()
 {
     int k1=,k2=;
     while (scanf("%d",&mid[])!=EOF)
     {
         pos=,m_sum=;
         k1=;
         for (int i=; i<=; i++)
             T[i].left=T[i].right=-,T[i].data=;
         while ()
         {
             char ch=getchar();
             if (ch=='\n') break;
             scanf("%d",&mid[k1++]);
         }
         k1--,k2=;
         while ()
         {
             scanf("%d",&last[k2++]);
             char ch=getchar();
             if (ch=='\n') break;
         }
         k2--;
         int T_head=create_tree(,k1,,k2);
         dfs(T_head,);
         printf("%d\n",pos);
     }
     return ;
 }