poj2255——Tree Recovery(应用二叉树)
来源:互联网 发布:广州淘宝美工培训班 编辑:程序博客网 时间:2024/05/21 22:40
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
题目不难,但必须要掌握树的三种遍历方法
#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[n] == 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;}
- poj2255——Tree Recovery(应用二叉树)
- poj2255- Tree Recovery(二叉树)
- POJ2255,Tree Recovery,二叉树重建
- poj2255 Tree Recovery 二叉树遍历
- POJ2255 Tree Recovery 二叉树遍历
- POJ2255 Tree Recovery(二叉树遍历)
- poj2255 Tree Recovery 二叉树,这题整我好惨
- poj2255~~Tree Recovery (树的遍历构造~)
- POJ2255 Tree Recovery 【树的遍历】
- POJ2255 Tree Recovery (先序中序-》后序)
- POJ2255 Tree Recovery
- poj2255 Tree Recovery
- poj2255 Tree Recovery
- POJ2255-Tree Recovery
- poj2255 Tree Recovery(递归)
- POJ2255----Tree Recovery
- poj2255 Tree Recovery 字典树 解题报告(Ulm Local 1997)
- poj2255(二叉树重建)
- Android Launcher全面剖析
- 使用 VisualVM 进行性能分析及调优
- poj2886
- Fix【推荐】
- 【Best Coder】Baby Ming and Weight lifting(水)
- poj2255——Tree Recovery(应用二叉树)
- 29 同位词的统计
- 包管理软件
- js 简单插入法排序
- Linux下Openssl的安装全过程
- Java中final用法
- 树---概念
- php 文件
- 挂载NTFS分区的两种方法