Tree
来源:互联网 发布:excel分析股票数据 编辑:程序博客网 时间:2024/06/11 18:13
Tree
时间限制:1000 ms | 内存限制:65535 KB
难度:3
- 描述
- Little Valentine liked playing with binary trees very much. Her favorite game was constructing randomly looking binary trees with capital letters in the nodes.
This is an example of one of her creations:D / \ / \ B E / \ \ / \ \ A C G / / F
To record her trees for future generations, she wrote down two strings for each tree: a preorder traversal (root, left subtree, right subtree) and an inorder traversal (left subtree, root, right subtree). For the tree drawn above the preorder traversal is DBACEGF and the inorder traversal is ABCDEFG.
She thought that such a pair of strings would give enough information to reconstruct the tree later (but she never tried it).
Now, years later, looking again at the strings, she realized that reconstructing the trees was indeed possible, but only because she never had used the same letter twice in the same tree.
However, doing the reconstruction by hand, soon turned out to be tedious.
So now she asks you to write a program that does the job for her!- 输入
- The input will contain one or more test cases.
Each test case consists of one line containing two strings preord and inord, representing the preorder traversal and inorder traversal of a binary tree. Both strings consist of unique capital letters. (Thus they are not longer than 26 characters.)
Input is terminated by end of file. - 输出
- For each test case, recover Valentine's binary tree and print one line containing the tree's postorder traversal (left subtree, right subtree, root).
- 样例输入
DBACEGF ABCDEFGBCAD CBAD
- 样例输出
ACBFGEDCDAB
- 上传者
- 苗栋栋
#include<cstdio>#include<cstring>#include<cstdlib>struct node{char value;node *leftchild;node *rightchild;};node *newnode(char c){node *p=(node *)malloc(sizeof(node));p->value=c;p->leftchild=p->rightchild=NULL;return p;}node *rebuild(char *pre,char *in,int len){if(len==0) return NULL; node *p=newnode(pre[0]); int i; for(i=0;i<len && in[i]!=pre[0];i++); int leftlen=i; int rightlen=len-i-1; if(leftlen>0) p->leftchild=rebuild(pre+1,in,leftlen); if(rightlen>0) p->rightchild=rebuild(pre+1+leftlen,in+leftlen+1,rightlen); return p;}void pos(node *p){if(p==NULL) return;pos(p->leftchild);pos(p->rightchild);printf("%c",p->value);}int main(){char preorder[30],inorder[30];while(scanf("%s%s",&preorder,&inorder)!=EOF){ int len=strlen(preorder); node *newtree=rebuild(preorder,inorder,len); pos(newtree); printf("\n");}return 0;}
0 0
- Tree
- tree
- tree
- TREE
- Tree
- Tree
- tree
- tree
- tree
- tree
- tree
- tree
- Tree
- Tree
- tree
- TREE
- tree
- tree
- Codeforces Round #294 (Div. 2) D
- cocos2d-x中的场景
- QT使用sizeHint()遇到的问题
- 黑马程序员——集合框架总结
- EassyMock实践 捕获参数
- Tree
- cocos2d-x中的精灵
- Java并发编程实践(读书笔记) 任务执行(未完)
- android进程间通信(远程服务aidl,服务端)
- “三位一体”新颖教学方式,助你学得更快更好
- Java多线程并发编程之显示锁ReentrantLock和读写锁
- c++基数排序
- cocos2d-x中精灵的属性
- STM32的LCD