模闆_二叉樹先序中序周遊求後序周遊

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
string s1,s2;
void calc(int l1,int r1,int l2,int r2){
    int m=s2.find(s1[l1]);
    if(m>l2) calc(l1+,l1+m-l2,l2,m-);
    if(m<r2) calc(l1+m-l2+,r1,m+,r2);
    cout<<s1[l1];
}
int main(){
    cin>>s1>>s2;
    calc(,s1.length()-,,s2.length()-);
    cout<<endl;return ; 
}