AC，∑ndless

112 - Tree Summing Time limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=48 Background LISP was one of the earliest high-le

思路： 1. 怎么建树？——对于给出的序列， 从左到右遍历，遇到代表数字的小写则建立一个无儿子的树（只保存值），然后把结点指针入栈；遇到代表操作符的大写字母，则从栈中弹出两个结点，然后建立一个以大写字母为根，弹出的两个节点为左右儿子的树，再把这个新树的根结点指针压入栈。如此循环下去。 最后，在栈顶的那个指针就是最后建成的树的根结点。 2. 怎么遍历输出？——模拟queue进行bfs扫描整棵树，扫描完成后逆序输出即可。 完整代码：

10562 - Undraw the Trees Time limit: 3.000 seconds  http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=104&page=show_problem&problem=1503 Professor Homer has been rep

839 - Not so Mobile Time limit: 3.000 seconds  http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=104&page=show_problem&problem=780 Before being an ubiquous communica

548 - Tree Time limit: 3.000 seconds  http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=104&page=show_problem&problem=489 You are to determine the value of the leaf

712 - S-Trees Time limit: 3.000 seconds A Strange Tree (S-tree) over the variable set  is a binary tree representing a Boolean function . Each path of the S-tree begins at theroot node and consi

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=477 /*0.009s*/ #include #include void solve(char *pre, char *in, int n, char *post) {