poj 2255 Tree Recovery

最新推荐文章于 2020-09-02 12:16:23 发布

joan333

最新推荐文章于 2020-09-02 12:16:23 发布

阅读量289

点赞数

分类专栏：二叉树字符串文章标签： tree traversal string each input pair

本文链接：https://blog.csdn.net/joan333/article/details/6641468

版权

字符串同时被 2 个专栏收录

4 篇文章 0 订阅

订阅专栏

二叉树

2 篇文章 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

这是一道由先序序列和中序序列求后序序列的题~

大致思想很简单~不用去建树~取先序序列中第一位在中序序列的位置~

再取两序列该位置左右的字符串~依次递归~

做完这题我最大的感触就是~字符串的题~还是c++比较好用~

#include"string"
#include"iostream"
using namespace std;
int n;
string post;
int Getpoststr(string s1,string s2)
{
    
	int q;
    int m;
   	q=s2.size();
	if(q==0)
		return 0;
	else
	{
		post.insert((string::size_type)0,1,s1[0]);
		m=s2.find(s1[0]);
		Getpoststr(s1.substr(m+1,q-m-1),s2.substr(m+1,q-m-1));求右边的子串~
		Getpoststr(s1.substr(1,m),s2.substr(0,m));求左边的子串~
	}
}

int main()
{
    string pre;
	string in;
	int n; 
	while(cin >> pre >> in)
	{
		post.clear();
		Getpoststr(pre,in);
		cout << post<<endl;	
	}
 
}