https://www.patest.cn/contests/gplt/L2-006
给出后序遍历和中序遍历求 层次遍历
#include<iostream>
#include<cstdio>
#include<stack>
#include<queue>
#include<vector>
#define N 50
using namespace std;
int a[N],b[N];//中序和后序
struct node
{
int l,r;
}tree[N];
int n;
int dfs(int la,int ra,int lb,int rb)//建树
{
if(la>ra) //防止出界
return 0;
int rt=b[rb],p1,p2;
p1=la;
while(a[p1]!=rt) p1++;//在中序序列中找到根的位置;
p2=p1-la;//左子树中节点的个数
tree[rt].l=dfs(la,p1-1,lb,lb+p2-1);//左子树
tree[rt].r=dfs(p1+1,ra,lb+p2,rb-1);//右子树
return rt;
}
void bfs(int x)//层次遍历
{
queue<int>q;
vector<int>v;
q.push(x);
while(!q.empty())
{
int w=q.front();
q.pop();
if(w==0)
break;
v.push_back(w);
if(tree[w].l!=0)
q.push(tree[w].l);
if(tree[w].r!=0)
q.push(tree[w].r);
}
int len=v.size();
for(int i=0;i<len;i++)
printf("%d%c",v[i],i==len-1?'\n':' ');
return;
}
int main()
{
//freopen("input.txt","r",stdin);
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%d",&b[i]);
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
dfs(0,n-1,0,n-1);
int root=b[n-1];
bfs(root);
return 0;
}