二叉树由先序和中序推出后序

递归代码

#include<stdio.h>
#include<string.h>
#define MAXN 256
 
void build(int n,char *s1,char *s2,char *s);
 
int main()
{
 char s1[MAXN],s2[MAXN],ans[MAXN];
 while(scanf("%s%s",s1,s2)==2)
 {
  int n=strlen(s1);
  build(n,s1,s2,ans);            
  ans[n]='\0';
  printf("%s\n",ans);                
 }   
 return 0;
}
 
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];    
}