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<cstdio>
#include<cstring>
#include<cmath>
#include<vector>
#include<set>
#include<map>
#include<algorithm>
using namespace std;
const int MAX = 1010;
class Node{
public:
char value;
Node *left;
Node *right;
Node();
};
Node* BuildTree(char *p,char *In,int length){
if(length == 0) return NULL;//这里是终止条件,当length == 0时,即查询到最左边或者最右边的叶子节点。
Node *temp = new Node();
int pos;
for(pos = 0;pos < length;++pos){
if(In[pos] == p[0]) break;
}
temp->value = p[0];
temp->left = BuildTree(p+1,In,pos);
temp->right = BuildTree(p+pos+1,In+pos+1,length-pos-1);
return temp;
}
void dfs(Node *p){
if(p == NULL) return;
dfs(p->left);
dfs(p->right);
printf("%c",p->value);
}
char pre[MAX],in[MAX];
int main(void){
while(scanf("%s%s",pre,in) != EOF){
Node *father = BuildTree(pre,in,(int)strlen(pre));
dfs(father);
printf("\n");
}
return 0;
}
Node::Node(){
value = '\0';
left = right = NULL;
}