POJ 2255 Tree Recovery(二叉树)
2014-08-11 20:16
387 查看
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
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
Sample Output
Source
Ulm Local 1997
题意:已知二叉树的先序和中序,求后续序列
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 11397 | Accepted: 7155 |
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 DBACEGFand 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
Source
Ulm Local 1997
题意:已知二叉树的先序和中序,求后续序列
#include <stdio.h> #include <iostream> #include <cstdio> #include <cstdlib> #include <cstring> #include <algorithm> #include <cmath> #include <string> #include <sstream> #include <vector> #include <queue> #include <set> #include <map> #include <ctime> using namespace std; typedef long long LL; struct node{ char c; struct node *left; struct node *right; }; struct node* createTree(char *pr,char *in,int n){ node *s; char *p; int k; if(n<=0)return NULL; s = (node *)malloc(sizeof(node)); s->c = pr[0]; for(p = in;p<in+n;p++){ if(*p == *pr)break; } k = p-in; s->left = createTree(pr+1,in,k); s->right = createTree(pr+k+1,p+1,n-k-1); return s; } void order(node *root){ if(root != NULL){ order(root->left); order(root->right); printf("%c",root->c); } } int main() { char pre[30],ino[30]; while(scanf("%s%s",pre,ino)!=EOF){ int n = strlen(pre); node *root = createTree(pre,ino,n); order(root); printf("\n"); } return 0; }
相关文章推荐
- POJ 2255 Tree Recovery && Ulm Local 1997 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
- poj2255 Tree Recovery
- poj2255 根据二叉树的前序和中序遍历 求出树的后序遍历
- POJ 2255/hrbust 2022 Tree Recovery【dfs、二叉树的层次遍历】
- POJ 2255 Tree Recovery
- poj 2255 Tree Recovery (由先序和中序建树)
- POJ 2255 Tree Recovery 二叉树的遍历
- POJ2255-Tree Recovery
- POJ 2255 经典的重建二叉树
- POJ 2255 重构二叉树