7-11 玩转二叉树 (25 分)---数据结构

#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <map>
#include <vector>
#include <queue>
#include <functional>
using namespace std;
struct Node
{
	int val,l,r;
}tr[10010];
signed main()
{
	int n;cin>>n;
	int in[35],pre[35];
	map<int,int>mp;
	for(int i=1;i<=n;i++)cin>>in[i],mp[in[i]]=i;
	for(int i=1;i<=n;i++)cin>>pre[i];
	int pos=1;
	function<void(int,int,int)> build = [&](int u,int l,int r)
	{
		if(l==r)
		{
			tr[u].val=-1;
			return ;
		}
		int root=pre[pos++];
		tr[u]={root,u<<1,u<<1|1};
		int mid=find(in+1,in+r,root)-in;
		build(u<<1,l,mid);
		build(u<<1|1,mid+1,r);
	};
	build(1,1,n+1);
	queue<int>q;
	q.push(1);
	while(q.size())
	{
		auto t=q.front();
		q.pop();
		if(tr[t].val==-1)continue;
		if(t!=1)cout<<" ";
		cout<<tr[t].val;
		q.push(tr[t].r);
		q.push(tr[t].l);
	}
	cout<<endl;
	
}