poj2255解题报告
来源:互联网 发布:农村淘宝电子商务ppt 编辑:程序博客网 时间:2024/05/02 03:10
Tree Recovery
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4585 Accepted: 3061
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:
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!
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.
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 ABCDEFGBCAD CBAD
Sample Output
ACBFGEDCDAB
题意:给出二叉树的两种遍历序列,输出第三种遍历序列....
思路:昨天数据结构课上老师讲的方法,,晚上回来写的程序....
- POJ2255 解题报告
- poj2255解题报告
- 【POJ2255】Tree Recovery解题报告 思路 + 数据 +代码
- poj2255 Tree Recovery 字典树 解题报告(Ulm Local 1997)
- poj2255
- poj2255
- poj2255
- poj2255
- poj2255
- POJ2255
- POJ2255
- POJ2255
- poj2255
- poj2255
- poj2255
- poj2255
- POJ2255
- POJ2255
- 常用的Emacs 命令
- MySQL Query to Json
- 如何让jquery datepicker 在同一页面使用多次
- log4j不同级别日志分不同文件记录
- 配置Zend framework环境
- poj2255解题报告
- select
- Sampling 随即取样问题归纳
- 动词+名词=do something
- flex资料
- 关于Hibernate不可能peristent detach entity的错误
- 圆饼图表示例
- 折线图表示例
- C++概念梳理