Tree(uva 548)

本题的思路还是比较简单的，利用中序和后序遍历构造出二叉树，然后深度优先遍历，选出最小权重值路径，输出其叶子节点。

是一道练习二叉树的好题。参考了一些大牛的代码，并作了一些修改。

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int in[10001];//inorder
int pos[10001];//postorder
struct Tree{
	int value;
	Tree *lch;
	Tree *rch;
};
Tree node[10001];
int t=0,a=0,tt;
inline Tree *NewNode(){
	node[tt].lch= NULL;
	node[tt].rch= NULL;
	return &node[tt++];
}
Tree *build(int *in,int *pos,int len){
	if(len==0||len>10000) return NULL;
	else{
		int i=len-1;
		while(pos[len-1]!=in[i]){
		i--;
		}
		Tree *h=NewNode();
		h->value=pos[len-1];
		h->lch=build(in,pos,i);
		h->rch=build(in+i+1,pos+i,len-1-i);
		return h;
	}
}
int mi[10001],minN[10001],k;
void dfs(Tree *r,int n){
	if(!r->lch&&!r->rch){
		mi[k]=n+r->value;
		minN[k]=r->value;
		k++;
	} 
	if(r->lch) dfs(r->lch,n+r->value);
	if(r->rch) dfs(r->rch,n+r->value);
}
int main(){
	char c;
	while(scanf("%d%c",&in[t++],&c)!=-1){
		if(c=='\n'){
				for(int i=0;i<t;i++)
					scanf("%d",&pos[i]);
				memset(mi,0,sizeof(mi));
				memset(minN,0,sizeof(minN));
				k=0;tt=0;
				Tree *root=build(in,pos,t);
				dfs(root,0);
				int M=mi[0],N=minN[0];
				for(int i=0;i<k;i++){
					if(M>mi[i]){
						M=mi[i];
						N=minN[i];
					}
					else if(M==mi[i]){
						if(N>minN[i])
							N=minN[i];
					}
				}
				printf("%d\n",N);
				memset(in,0,sizeof(in));
				memset(pos,0,sizeof(pos));
				t=0;a=0;
		}
	}
	return 0;}