POJ 2255 Tree Recovery(二叉树重建)
来源:互联网 发布:伊斯兰教知乎 编辑:程序博客网 时间:2024/05/18 00:23
Tree Recovery
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11443 Accepted: 7182
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
Source
Ulm Local 1997
题意:输入一棵二叉树的先序遍历和中序遍历序列,输出它的后续遍历序列。
分析:先序遍历的第一个字符就是根,因此只需在中序遍历中找到它,就可以知道左右子树的先序遍历和后序遍历了。
#include <stdio.h>#include <string.h>char s[30],s1[30],s2[30];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,s);s[n]='\0';printf("%s\n",s);}return 0;}
0 0
- POJ 2255 Tree Recovery(二叉树重建)
- (二叉树重建)Tree Recovery(P2255)
- POJ2255,Tree Recovery,二叉树重建
- 二叉树重建(Tree Recovery ,UVa536)
- uva 536 Tree Recovery(二叉树重建)
- POJ 2255 Tree Recovery 二叉树遍历
- POJ 2255 Tree Recovery [二叉树]
- Poj 2255-Tree Recovery//二叉树,递归
- POJ 2255 Tree Recovery ( 二叉树)
- POJ 2255 Tree Recovery 二叉树基础
- POJ 2255 Tree Recovery 二叉树恢复
- POJ 2255 Tree Recovery(二叉树)
- POJ 2255 Tree Recovery (二叉树遍历)
- poj 2255 Tree Recovery(二叉树)
- 【POJ 2255 Tree Recovery】+ 二叉树
- POJ 2255 Tree Recovery 二叉树
- POJ 2255Tree Recovery 二叉树重建(根据前序遍历和中序遍历写出后序遍历)
- 习题6-3 UVA 536 Tree Recovery 二叉树重建
- python的socket通信实例
- 关于微信上的一些转发即可得iphone的骗术
- 比较简单优美的网站设计
- Android计算函数时间戳的方法
- 从Trie树(字典树)谈到后缀树(10.28修订)(转载)
- POJ 2255 Tree Recovery(二叉树重建)
- 3031:筷子(stick) 动态规划
- 图像处理之图像距
- fghfgh
- 鲍尔默做错了什么?
- Win系统下用Eclipse中运行远程hadoop MapReduce程序出现Permission denied错误
- IOS NavigationController
- 菜鸟小试之二:MHA failover切换
- [java多线程]多线程数据共享