#include<iostream>
#include<string>
using namespace std;
void Preorder(string inorder,string postorder)
{
if(inorder.size()>0)
{
char ch=postorder[postorder.size()-1];
cout<<ch;
int k=inorder.find(ch);
Preorder(inorder.substr(0,k),postorder.substr(0,k));
Preorder(inorder.substr(k+1),postorder.substr(k,inorder.size()-k-1));
}
}
int main()
{
string inorder,postorder;
cin>>inorder;
cin>>postorder;
Preorder(inorder,postorder);
cout<<endl;
return 0;
}
已知二叉树的中序和后序遍历排列,求前序遍历
最新推荐文章于 2024-08-08 22:07:05 发布