tree_recovery(递归)poj2255

题目：http://poj.org/problem?id=2255

题目：

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 <stdio.h>
#include <string.h>
using namespace std;

void build(int n,char *s1,char *s2)
{
    if(n <= 0)return ;
    int p = strchr(s2,s1[0]) - s2;
    build(p,s1 + 1,s2);//p,字符串的长度，先序的起点，后续的起点
    build(n - p - 1,s1 + 1 + p,s2 + p + 1);
    printf("%c",s1[0]);
}

int main()
{
    char s1[50],s2[50];
    while(scanf("%s %s",s1,s2)!=EOF)
    {
        int n = strlen(s1);
        build(n,s1,s2);
        printf("\n");
    }
    return 0;
}