C语言数据结构树之后序遍历的实现

#include <iostream>#include <string>using namespace std;string s1="abdec";//先序遍历string s2="dbeac";//中序遍历void calc(int l1,int r1,int l2,int r2){  int m=s2.find(s1[l1]);  //cout<<m<<endl;  if(m>l2) calc(l1+1,l1+m-l2,l2,m-1);  if(m<r2) calc(l1+m-l2+1,r1,m+1,r2);  //cout<<s2[m]<<" ";  cout<<s1[l1];} int main(){    calc(0,s1.length()-1,0,s2.length()-1);   cout<<endl;  return 0;}