SDUTOJ 1291 数据结构上机测试4.1:二叉树的遍历与应用1

#include<iostream>
#include<string.h>
using namespace std;
void build(int n,char *s1,char *s2,char *s)
{
	if(n<=0)  return;
	int p =strchr(s2,s1[0])-s2;
	build(p,s1+1,s2,s);
	build(n-p-1,s1+p+1,s2+p+1,s+p);
	s[n-1]=s1[0];
}
int main()
{
	char s1[50],s2[50],ans[50];
	cin>>s1>>s2;
	int n=strlen(s1);
	build(n,s1,s2,ans);
	ans[n]='\0';
    cout<<ans<<endl;
	return 0;
}