poj——2255——Tree Recovery

最新推荐文章于 2019-10-31 20:59:59 发布

清溪浅水

最新推荐文章于 2019-10-31 20:59:59 发布

阅读量442

点赞数

分类专栏：树

本文链接：https://blog.csdn.net/u011470356/article/details/21464529

版权

树专栏收录该内容

7 篇文章 0 订阅

订阅专栏

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 <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
using namespace std;
char pre[100];//先序遍历
char in[100];//中序遍历
char post[100];//后序遍历
int len;//节点个数
void solve(int p1,int p2,int m1,int m2)
{
    if(p1>p2)
    return;
    int i;
    for(i=m1;i<=m2;i++)
    {
        if(in[i]==pre[p1])
        break;
    }
    post[--len]=pre[p1];
    if(p1==p2)
    return;
    solve(p1+i-m1+1,p2,i+1,m2);
    solve(p1+1,p1+i-m1,m1,i-1);
}
int main()
{
    while(cin>>pre>>in)
    {
        memset(post,0,sizeof(post));
        len=strlen(pre);
        solve(0,len-1,0,len-1);
        cout<<post<<endl;
    }
    return 0;
}