UVA548-Tree(二叉树数组表示)

Problem UVA548-Tree

Accept: 2287  Submit: 13947

Time Limit: 3000 mSec

Problem 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

 

题解：这个题有两个有价值的地方，一个是二叉树的数组实现，一个是通过中序和后序遍历构造处二叉树的先序遍历。

二叉树的数组实现也是递归的方式，在这个地方由于题目中说明节点权值都不一样而且权值的范围也很适合作为数组下标，因此直接用权值作为节点下标建树。

通过中序和后序遍历构造先序遍历建树并不困难，只要熟悉三种遍历的过程，就很容易找到方法。后序遍历的最后一个必定是根节点，然后他的前面，一部分是左子树，一部分是右子树，

这个时候问题就是精确到哪一位是左子树，利用中序遍历轻松搞定，在中序遍历中找到根节点，左边就是左子树，右边就是右子树，那各有几个就很清楚了，之后就交给递归就好了，需要注意递归基，

也就是在中序遍历序列中找不到子树区间的时候，也就是左端点 > 右端点的时候。

一般情况下，用数组实现二叉树需要自己“申请”节点，也就是和链式前向星里的tot++差不多的操作

const int root = 1;
int cnt;

void newtree(){
    lchild[root] = rchild[root] = 0;
    have_val[root] = false;
    cnt = root;
}

int newnode(){
    int u = ++cnt;
    lchild[u] = rchild[u] = 0;
    have_val[u] = false;
    return u;
}

摘自紫书。

以下是该题代码

#include <iostream>
#include <string>
#include <cstdlib>
#include <cstdio>
#include <sstream>
#include <algorithm>
#define INF 0x3f3f3f3f
using namespace std;

const int maxn = 10000+10;
int in_order[maxn],post_order[maxn];
int lchild[maxn],rchild[maxn];
int n,ans,Min;

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

int build(int l1,int r1,int l2,int r2){
    if(l1 > r1) return 0;
    int root = post_order[r2];
    int i = l1;
    while(in_order[i] != root) i++;
    int cnt = i-l1;
    lchild[root] = build(l1,i-1,l2,l2+cnt-1);
    rchild[root] = build(i+1,r1,l2+cnt,r2-1);
    return root;
}

void dfs(int root,int val){
    val += root;
    if(!lchild[root] && !rchild[root]){
        if(Min == val) ans = ans < root ? ans : root;
        else if(val < Min) ans = root,Min = val;
        return;
    }
    if(val > Min) return;
    if(lchild[root]) dfs(lchild[root],val);
    if(rchild[root]) dfs(rchild[root],val);
}

int main()
{
    //freopen("input.txt","r",stdin);
    while(read_list(in_order)){
        read_list(post_order);
        ans = 0,Min = INF;
        build(0,n-1,0,n-1);
        dfs(post_order[n-1],0);
        printf("%d\n",ans);
    }
    return 0;
}