# 重建二叉树

293人阅读 评论(0)

## Tree

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

【直播】机器学习&数据挖掘7周实训--韦玮
【套餐】系统集成项目管理工程师顺利通关--徐朋
【直播】3小时掌握Docker最佳实战-徐西宁
【套餐】机器学习系列套餐（算法+实战）--唐宇迪
【直播】计算机视觉原理及实战--屈教授
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
【直播】机器学习之矩阵--黄博士
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
【直播】机器学习之凸优化--马博士
【套餐】Javascript 设计模式实战--曾亮

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