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: 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 file 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).
1.一看到这道题就想到了UVa548,然后就建树+遍历那样写了,结果却TLE,看来是数据的量很大
2.去网上看,才发现,build的过程直接输出就行,因为我们建树过程也就是不断寻找根的过程,那么每找到一个根,先遍历左右子树,最后输出即可,省去了建树的过程,确实值得学习
#include <iostream>
#include <string.h>
#include <string>
using namespace std;
int len;
string pre,in;
void dfs(int b1,int e1,int b2,int e2){
if(b1>e1) return;
int k=b2;
while(in[k]!=pre[b1]) k++;
int res=k-b2;
dfs(b1+1,b1+res,b2,b2+res-1);
dfs(b1+res+1,e1,k+1,e2);
printf("%c",pre[b1]);
}
int main()
{
while(cin>>pre){
cin>>in;
len=pre.size();
dfs(0,len-1,0,len-1);
printf("\n");
}
return 0;
}