ACM--二叉树-已知前中序求后序--POJ-2255

    北大OJ地址：点击打开链接

Tree Recovery

Time Limit: 1000MS
Memory Limit: 65536KTotal Submissions: 13336
Accepted: 8322

Description

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 ABCDEFGBCAD CBAD

Sample Output

ACBFGEDCDAB

题意：已知二叉树的前序遍历和中序遍历，输出后序遍历。
前序遍历：根-->左孩子-->右孩子
中序遍历：左孩子-->根-->右孩子
后序遍历：左孩子-->右孩子-->根
所谓的前中后指的是根的位置，而左右孩子顺序是不变的。

例如已知前序遍历是DBACEGF，中序遍历是ABCDEFG，那么由前序遍历先根，可知道D是树的根，再看在中序遍历中D左边是ABC，所以可知道ABC一定在D的左子树上，而EFG在D的右子树上。
那么前序遍历为BAC,中序遍历为ABC，所以B为根，在中序遍历中A在B的左边，C在B的右边，所以A为B的左孩子，C为B的有孩子。
以此类推递归下去。

递归找到，代码很简单，但是要明白怎么递归：

#include <iostream>#include<stdio.h>#include<stdlib.h>#include<string.h>using namespace std;/**   已知先序和中序，将后序求出来并   存入数组s中*/void print(int n,char * s1,char * s2,char * s){    if(n<=0)        return ;    /*      功能：查找字符s2中首次出现s1[0]的位置      说明：返回首次出现s1[0]的位置的指针，      如果s2中不存在c则返回NULL     */     int p = strchr(s2,s1[0])-s2;     //这个是采用递归得到左子树     print(p,s1+1,s2,s);     //这个是采用递归得到右子树     print(n-1-p,s1+p+1,s2+p+1,s+p);     //要得到后序遍历,所以整个的最后一个是根     s[n-1] = s1[0];}int main(){    /*    定义s1用来存放前序，s2用来存放中序    ans用来存放后序    */    char s1[30],s2[30],ans[30];    memset(s1,0,sizeof(s1));    memset(s2,0,sizeof(s2));    //EOF表示无更多的资料可读，是循环终止的条件    while(scanf("%s %s",s1,s2)!=EOF)    {        //获取数组s1的长度        int n=strlen(s1);        print(n,s1,s2,ans);        ans[n]='\0';        printf("%s\n",ans);    }    return 0;}

参考博客：http://www.cnblogs.com/-sunshine/archive/2012/07/24/2606341.html