poj2255——Tree Recovery(应用二叉树)
2016-01-23 20:32
302 查看
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!
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
题目不难,但必须要掌握树的三种遍历方法
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
题目不难,但必须要掌握树的三种遍历方法
#include<cstdio> #include<cstdlib> #include<cstring> char mid[27]; char pre[27]; int n = -1; void make_tree(int i, int j) { int k; if(i > j) //i>j,表示树已建完,返回函数 return; n++; for(k = i; k <= j; k++) { if(pre == mid[k]) //先序的第一个字母是节点,因此在中序中找到对应节点的位置 break; } make_tree(i, k - 1); //以节点为界,之前的为左子树建树 make_tree(k + 1, j); //右子树建树 printf("%c", mid[k]); //因为是后序遍历,所以最后输出节点 } int main() { while(scanf("%s%s", pre, mid) == 2) { make_tree(0, strlen(pre) - 1); //建树,范围从0到先序的最后一个字母 printf("\n"); n = -1; } return 0; }
相关文章推荐
- SPFA随手写,容易理解的
- 【Best Coder】Baby Ming and Weight lifting(水)
- Python使用Requests第三方库自动登陆知乎
- js基础教程学习笔记
- MongoDB基本操作(增删改查)
- 全局变量引发的链接时的LNK2005xxx already defined in yyyy.obj
- xwiki6.X版本升级日志
- leetcode--Palindrome Number
- c++中类对象分配内存大小与虚继承的一些问题
- 关于cisco网络设备访问控制列表ACL中IN、OUT的理解
- 玩诈欺的小杉【推荐】
- PAT1076 Forwards on Weibo
- eclipse环境搭建之三:Python
- 几种经典的网络服务器架构模型的分析与比较
- 关于Struts2.xml的配置
- leetcode--Unique Paths && Unique Paths ii
- hadoop-2.6.0分布式环境搭建详细过程
- ZOJ2588 Burning Bridges(割边模板)
- 【C语言】写一个函数,实现字符串内单词逆序
- PHP 清除 Excel 导入的数据空格