二叉树已知前序中序求后序

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<map>
#include<queue>
using namespace std;
void dfs(string a,string b)
{

    if(b.size())
    {
         char c=a[0];
         int k=b.find(c);
        dfs(a.substr(1,k),b.substr(0,k));
        dfs(a.substr(k+1),b.substr(k+1));
         cout<<c;
    }
}
int main()
{
    string a,b;
    while(cin>>a>>b)
    {
        dfs(a,b);
        cout<<endl;
    }
    return 0;
}