关闭

重建二叉树

306人阅读 评论(0) 收藏 举报
分类:

Tree

时间限制:1000 ms  |  内存限制:65535 KB
难度:3
描述
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! 
输入
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.
输出
For each test case, recover Valentine's binary tree and print one line containing the tree's postorder traversal (left subtree, right subtree, root).
样例输入
DBACEGF ABCDEFG
BCAD CBAD
样例输出
ACBFGED
CDAB
思路: 
    前序遍历经过的点,在中序对应的序列中对应位置的左右两边就是左右子树
#include<stdio.h>
#include<string.h>
char pre[1000], in[1000];
int len,step;
void search(int l, int r, int i){
	int j;
	if(step == len){
		return ;
	}
	for(j = l; j < r; j++){
		if(in[j] == pre[step]){
			step++;
			break;
		}
	}
	if(j == r){
		return ;
	}
	search(l, j,i + 1);
	search(j + 1, r, i + 1);
	printf("%c", in[j]);


}

int main(){

	int i;
	while(scanf("%s%s", pre, in) != EOF){
		getchar();
		step = 0;
		len = strlen(pre);
		search(0, len , 0);
		printf("\n");
	}
	return 0;
}

0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:41649次
    • 积分:1233
    • 等级:
    • 排名:千里之外
    • 原创:84篇
    • 转载:13篇
    • 译文:0篇
    • 评论:1条
    最新评论