树的前序，中序，后序遍历。

输入树的前序与中序，输出后序。

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
#define MAX 20
void built(int n,char*s1,char*s2,char*s)
{
	if(n<=0)return;
	int p=strchr(s2,s1[0])-s2;
	built(p,s1+1,s2,s);
	built(n-p-1,s1+p+1,s2+p+1,s+p);
	s[n-1]=s1[0];
}
int main()
{
	char s1[MAX],s2[MAX],ans[MAX];
	while(scanf("%s%s",s1,s2)==2)
	{
		int n=strlen(s1);
		built(n,s1,s2,ans);
		ans[n]='\0';
		printf("%s\n",ans);
	}
	return 0;
}