二叉树
1
__meteor
对于未来, 我只是一个孩子;
展开
-
HRBUST - 2040 二叉树的遍历(由前序遍历和中序遍历推出后序遍历)
原题 #include #include using namespace std; int n, pre[110], in[110], post[110], cnt=0; int find(int ist, int ied, int target){ for(int i=ist; i<ied; i++) if(in[i]==target) return i; } void po转载 2017-07-29 10:41:02 · 268 阅读 · 0 评论 -
HRBUST - 2040二叉树的遍历
二叉树的遍历 Time Limit: 1000 MS Memory Limit: 32768 K Total Submit: 286(74 users) Total Accepted: 118(68 users) Rating: Special Judge: No Description给出一棵二叉树的中序和前序遍历,输出它的后序遍历原创 2017-09-11 11:08:51 · 272 阅读 · 0 评论 -
PAT甲级1143. Lowest Common Ancestor (BST共同祖先)
1143. Lowest Common Ancestor (30)时间限制200 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueThe lowest common ancestor (LCA) of two nodes U and V in a tree is the deepest node that has both U and V as ...原创 2018-03-19 20:38:11 · 298 阅读 · 0 评论