解题思路:第一次写二叉树遍历的代码,还想了一下,发一下代码,以表纪念
#include<cstdio>
#include<cstring>
#include<queue>
#include<stack>
#include<set>
#include<algorithm>
using namespace std;
struct node
{
int l,r;
}s[50];
int af[40],mi[40];
int build(int la,int ba,int lm,int bm)
{
if(la>ba) return -1;
int rt=af[bm];
int id=la;
while(mi[id]!=rt) id++;
int rtl=build(la,id-1,lm,lm+id-la-1);
int rtr=build(id+1,ba,lm+id-la,bm-1);
s[rt].l=rtl;
s[rt].r=rtr;
return rt;
}
void bfs(int rt)
{
queue<int> q;
q.push(rt);
int cnt=0;
while(!q.empty())
{
int u=q.front();
q.pop();
if(cnt==0)
printf("%d",u);
else
printf(" %d",u);
cnt++;
if(s[u].l!=-1)
q.push(s[u].l);
if(s[u].r!=-1)
q.push(s[u].r);
}
}
int main()
{
//freopen("t.txt","r",stdin);
int n,rt;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&af[i]);
}
for(int i=0;i<n;i++)
{
scanf("%d",&mi[i]);
}
rt=build(0,n-1,0,n-1);
bfs(rt);
return 0;
}