poj 2255 Tree Recovery 递归

最新推荐文章于 2019-01-05 21:05:29 发布

欧莎

最新推荐文章于 2019-01-05 21:05:29 发布

阅读量265

点赞数

分类专栏：深搜

本文链接：https://blog.csdn.net/xiaosshhaa/article/details/53424938

版权

深搜专栏收录该内容

16 篇文章 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<algorithm>
#include<stdio.h>
#include<string>
#include<string.h>
using namespace std;
void dfs(string a,string b)
{
    int ll,lr;
    for(int i=0;i<b.length();i++)
    {
        if(a[0]==b[i])
        {
            ll=i; lr=b.length()-ll-1;
            if(ll)
            {
                string Lp(a,1,ll);//取出左子树的前序遍历
                string Li(b,0,ll); //取出左子树的中序遍历
                dfs(Lp,Li); //递归求左子树
            }
            if(lr)
            {
                string Rp(a,1+ll,lr); string Ri(b,ll+1,lr);
                dfs(Rp,Ri);
            }
            cout<<a[0];
        }
    }
}
int main()
{
    string a,b;//a是前序遍历，b是中序遍历
    while(cin>>a)
    {
        cin>>b;
        dfs(a,b);printf("\n");
    }
    return 0;
}