poj2255 给出二叉树前中求后序遍历

http://poj.org/problem?id=2255

#include <iostream>
#include<cstdio>
#include<cstring>
using namespace std;
#define N 30
char s[N],s1[N],s2[N];
void build(int len,char *s1,char *s2,char *s)
{
    if(len)
    {int p=strchr(s2,s1[0])-s2;
    build(p,s1+1,s2,s);
    build(len-p-1,s1+1+p,s2+p+1,s+p);
    s[len-1]=s1[0];}
}
int main()
{
    int len;
    while(scanf("%s%s",s1,s2)!=EOF)
    {
        len=strlen(s1);
        build(len,s1,s2,s);
        s[len]='\0';
        cout<<s<<endl;
    }
    return 0;
}