重建二叉树

原创 2013年12月04日 21:55:56

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;
}

由前序遍历和中序遍历重建二叉树

题目: 输入某二叉树的前序遍历和中序遍历的结果,请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含有重复的数字。例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7...

二叉树的重建java代码

  • 2015年12月01日 10:46
  • 2KB
  • 下载

中山大学 sicily 二叉树重建

  • 2012年10月31日 15:33
  • 2KB
  • 下载

已知中序遍历和先序遍历重建二叉树

// 根据前序遍历和中序遍历求二叉树的结构 // 已知前序遍历的第一个值为根节点 而根节点在中序遍历中的位置就能确定他的左右子树...

二叉树重建 sicily1935

  • 2011年05月17日 21:11
  • 15KB
  • 下载

数据结构课程设计二叉树的重建

  • 2010年08月29日 10:25
  • 15KB
  • 下载

剑指offer 重建二叉树

题目描述: 输入某二叉树的前序遍历和中序遍历的结果,请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:重建二叉树
举报原因:
原因补充:

(最多只允许输入30个字)