Uva-548-Tree(二叉树与stream与dfs)
来源:互联网 发布:易观大数据峰会 编辑:程序博客网 时间:2024/05/21 17:50
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 63 1 2 5 6 7 47 8 11 3 5 16 12 188 3 11 7 16 18 12 5255255
Sample Output
13255
#include <cstdio>#include <iostream>#include <algorithm>#include <string>#include <sstream>using namespace std;#define BG 10005int in_order[BG],post_order[BG];int lrp[BG],rrp[BG];//use two queue to take the left and right child seperatly of the i point to show what the tree is look like.int n;bool input(int *order){ string s; stringstream ss;//deivide and transform the string int i=1; n=0; if(getline(cin,s)) { ss.str(s); while(!ss.fail()) { ss>>order[i]; i++; n++; } return true; } else return false;}int buildtree(int L1,int R1,int L2,int R2)//{ if(L1<=R1) { int root; root=post_order[R2]; int p=1; while(in_order[p]!=root)p++; int ln; ln=p-L1; lrp[root]=buildtree(L1,p-1,L2,L2+ln-1);//the left child tree of the root in the in_order and the post_order(to find its root--the left child of the current root) rrp[root]=buildtree(p+1,R1,L2+ln,R2-1); return root; } else return 0;}int best_sum=100000000,res;void dfs(int root,int csum)//csum help store the specific value of sum at that moment{ csum+=root; if(lrp[root]==0&&rrp[root]==0)//leaves { if(best_sum>csum||(best_sum==csum&&res>root)) { res=root; best_sum=csum; } } else { if(lrp[root])dfs(lrp[root],csum);//to the deepest and once a time if(rrp[root])dfs(rrp[root],csum); } }int main(){ while(input(in_order)) { int proot; best_sum=100000000; input(post_order); proot=buildtree(1,n-1,1,n-1); dfs(proot,0); printf("%d\n",res); }}
- Uva-548-Tree(二叉树与stream与dfs)
- UVa 548 - Tree 二叉树的重建与遍历
- UVa 548 - Tree【二叉树的递归遍历(DFS)】
- [UVA 536] Tree Recovery 二叉树&dfs
- UVA 548 Tree 【树+DFS】
- 二叉树 UVA 548 Tree
- UVA - 548 Tree 二叉树
- UVa--548 Tree(二叉树)
- Tree UVA 548(DFS)
- UVA 548 Tree 中序+后序构造二叉树dfs
- UVA 548(DFS)+二叉树遍历
- UVa 548 - Tree 二叉树的重建——中序遍历与后续遍历进行建树
- UVA 536 Tree Recovery 二叉树重建(重建二叉树+DFS)
- UVA 548 Tree(数据结构,二叉树,遍历)
- UVA 548-Tree(二叉树)
- UVa 548 - Tree(二叉树)
- UVA 548Tree(二叉树建树)
- 【UVA 548 Tree】二叉树构造 & 遍历
- iOS 微信第三方登录
- XML(2)——结识DTD
- poj3311 TSP问题 状压DP
- Linux内核module_param的使用
- vc++ DLL开发小结
- Uva-548-Tree(二叉树与stream与dfs)
- 堆排序
- 抽象类、密封类及类成员(C#)
- 移位运算RGB
- Google 开源技术protobuf
- STL源码剖析 [容器](十)[Binary search tree]
- LeakCanary 中文使用说明
- 魔术索引I
- ubuntu12.04如何删除ppa源