/*
前序遍历:根,左,右
中序遍历:左,根,右
后序遍历:左,右,根
输入前序,中序遍历求后序遍历
*/
#include<iostream>
#include<string>
using namespace std;
void pos(string qian,string zhong)
{
if(qian.size()==0)
return;
else if(qian.size()==1)
cout<<qian[0];
else
{
int mid=zhong.find(qian[0]);
pos(qian.substr(1,mid),zhong.substr(0,mid));//递归左子树
pos(qian.substr(mid+1,qian.size()-mid),zhong.substr(mid+1,zhong.size()-mid));
cout<<qian[0];
}
}
int main()
{
string pre,mid;
cin>>pre>>mid;
pos(pre,mid);
return 0;
}
前序遍历:根,左,右
中序遍历:左,根,右
后序遍历:左,右,根
输入前序,中序遍历求后序遍历
*/
#include<iostream>
#include<string>
using namespace std;
void pos(string qian,string zhong)
{
if(qian.size()==0)
return;
else if(qian.size()==1)
cout<<qian[0];
else
{
int mid=zhong.find(qian[0]);
pos(qian.substr(1,mid),zhong.substr(0,mid));//递归左子树
pos(qian.substr(mid+1,qian.size()-mid),zhong.substr(mid+1,zhong.size()-mid));
cout<<qian[0];
}
}
int main()
{
string pre,mid;
cin>>pre>>mid;
pos(pre,mid);
return 0;
}