poj 2255 Tree Recovery

时间：2015-07-12 22:57:21 阅读：405 评论：0 收藏：0 [点我收藏+]

Tree Recovery

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 12413		Accepted: 7765

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

Source

Ulm Local 1997

 1 #include <stdio.h>
 2 #include <cstring>
 3 #include <queue>
 4 #include <iostream>
 5 using namespace std;
 6 void findmid(string pre,string in){
 7     //cout<<"1 "<<pre<<" "<<in<<endl;
 8     char c=pre[0];//根节点
 9     //cout<<"1"<<c<<endl;
10     int i;
11     for(i=0;i<in.length();i++){
12         if(c==in[i]){
13             break;
14         }
15     }
16     if(i)  //左子树不空
17     findmid(pre.substr(1,i),in.substr(0,i));
18     if(i<in.length()-1)//右子树不空
19     findmid(pre.substr(i+1),in.substr(i+1));
20     cout<<c;
21 }
22 int main(){
23     //freopen("D:\\INPUT.txt","r",stdin);
24     string pre,in;
25     while(cin>>pre>>in){
26             findmid(pre,in);
27             cout<<endl;
28     }
29     return 0;
30 }

poj 2255 Tree Recovery

原文：http://www.cnblogs.com/Deribs4/p/4641565.html

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年09月23日 (328)
2021年09月24日 (313)
2021年09月17日 (191)
2021年09月15日 (369)
2021年09月16日 (411)
2021年09月13日 (439)
2021年09月11日 (398)
2021年09月12日 (393)
2021年09月10日 (160)
2021年09月08日 (222)