POJ 2255 Tree Recovery
2012-07-17 10:58
288 查看
决定把这次培训教过的从简单的到难的再深度一次,特别是自己教的图这部分,还有强连通,先把最小生成树和次小生成树搞定把。这是给你树的前序和中序,输出后序。
#include<stdio.h> #include<string.h> char s1[30],s2[30],c,l1,l2; void Tree(int i,int j) { if( i>j) return ; int k; char root=s1[c++]; for( k=i; k<=j; k++) if( root==s2[k]) break; Tree(i,k-1); Tree(k+1,j); printf("%c",root); } int main() { while( scanf("%s %s",s1,s2)!=EOF){ l2=strlen(s2); c=0; Tree(0,l2-1); printf("\n"); } return 0; }
相关文章推荐
- POJ--2255 Tree recovery
- poj2255 Tree Recovery
- POJ 2255 Tree Recovery
- POJ 2255 Tree Recovery
- POJ 2255 Tree Recovery && Ulm Local 1997 Tree Recovery (二叉树的前中后序遍历)
- POJ 2255 Tree Recovery
- POJ 2255 Tree Recovery
- POJ 2255 Tree Recovery(二叉树)
- POJ 2255 Tree Recovery
- poj 2255 Tree Recovery
- Tree Recovery--POJ 2255
- POJ 2255 Tree Recovery
- poj 2255 Tree Recovery(二叉树)
- poj_2255 Tree Recovery(已知前序遍歷和中序遍歷求後序遍歷)
- poj——2255——Tree Recovery
- poj 2255 Tree Recovery
- poj-2255-Tree Recovery
- POJ2255-Tree Recovery
- poj 2255 Tree Recovery(做为二叉树的练笔挺不错的)
- POJ2255-Tree Recovery