题意:已知前序遍历和中序遍历,输出后序遍历
//超时的时候可以试试将cin、cout换成scanf、printf
#include <bits/stdc++.h>
using namespace std;
struct node
{
int data;
struct node *lchild,*rchild;
};
int n;
int pre[50005],in[50005];
vector<int> po;
node *buildTree(int pl,int pr,int il,int ir)
{
if(pl>pr)
return NULL;
int t=il;
while(in[t]!=pre[pl]&&t<=ir)
t++;
node *binode=(node*)malloc(sizeof(node));
binode->data=pre[pl];
binode->lchild=buildTree(pl+1,pl+t-il,il,t-1);
binode->rchild=buildTree(pl+t-il+1,pr,t+1,ir);
return binode;
}
void post(node *T)
{
if(T){
post(T->lchild);
post(T->rchild);
po.push_back(T->data);
}
}
int main()
{
int n;
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%d",&pre[i]);
for(int i=0;i<n;i++)
scanf("%d",&in[i]);
struct node *root;
root=buildTree(0,n-1,0,n-1);
post(root);
printf("%d\n",po[0]);
return 0;
}