POJ2255,Tree Recovery,二叉树重建
来源:互联网 发布:d3.js api 编辑:程序博客网 时间:2024/05/21 08:45
Tree Recovery
Description
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!
Input
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.
Output
For each test case, recover Valentine's binary tree and print one line containing the tree's postorder traversal (left subtree, right subtree, root).
Sample Input
DBACEGF ABCDEFG
BCAD CBAD
Sample Output
ACBFGED
CDAB
分析:
典型的二叉树重建,给出先序中序,输出后续遍历。
这里用白书中的递归方式,程序简洁。
code:
#include<iostream>#include<cstdio>#include<cstring>#include<cmath>#include<string>char s1[30];char s2[30];char s3[30];using namespace std;void build(int n,char *s1,char *s2,char *s){ if(n<=0) return; int p=strchr(s2,s1[0])-s2; build(p,s1+1,s2,s); build(n-p-1,s1+p+1,s2+p+1,s+p); s[n-1]=s1[0];}int main(){ while(scanf("%s %s",s1,s2)==2) { int n=strlen(s1); build(n,s1,s2,s3); s3[n]='\0'; printf("%s\n",s3); } return 0;}
- POJ2255,Tree Recovery,二叉树重建
- poj2255 Tree Recovery 二叉树遍历
- poj2255- Tree Recovery(二叉树)
- POJ2255 Tree Recovery 二叉树遍历
- POJ2255 Tree Recovery(二叉树遍历)
- poj2255 Tree Recovery 二叉树,这题整我好惨
- poj2255——Tree Recovery(应用二叉树)
- poj2255(二叉树重建)
- poj2255(二叉树重建)
- (二叉树重建)Tree Recovery(P2255)
- POJ 2255 Tree Recovery(二叉树重建)
- 二叉树重建(Tree Recovery ,UVa536)
- uva 536 Tree Recovery(二叉树重建)
- poj2255~~Tree Recovery (树的遍历构造~)
- POJ2255 Tree Recovery 【树的遍历】
- POJ2255 Tree Recovery
- poj2255 Tree Recovery
- poj2255 Tree Recovery
- PM俱乐部建设之旅2-第一次会议
- 堆与堆排序
- 从汇编、内存的角度看类中的this指针 .
- 网络操作系统和分布式系统区别简介
- 现实终究会历练我们,是现实太无奈~
- POJ2255,Tree Recovery,二叉树重建
- Windows Server 2012让工作风格现代化
- 用"再生龙"Clonezilla 来克隆Linux系统
- 【资源】机器学习资源积累(积累中...)
- java I/O操作总结
- D兔发布经典伤感日志_是真爱,就用不言弃
- mysql的字符集问题
- 写尽凄凉,沧桑,却写不出那最后一抹忧伤
- ImageView.ScaleType设置图解