先序中序遍历构建二叉树

先序的第一个是根节点。

中序的节点左边是左子树，节点右边是柚子树。

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<map>
#include<vector>
#include<set>
#include<cmath>
#include<deque>
#include<queue>
#define int long long
#define endl "\n"

using namespace std;

struct node
{
	int data,left,right;
};

vector<int> in,pre;
vector<node> T;
map<int,int> mp;
int p=-1;

//中序前序遍历建二叉树
int build(int inL,int inR,int preL,int preR)
{
	if(inL>inR || preL>preR) return -1;
	int data=pre[preL];
	int idx=mp[data];
	int pos= ++p;
	int l=idx-inL;
	T[pos].data=data;
	T[pos].left=build(inL,idx-1,preL+1,preL+l);
	T[pos].right=build(idx+1,inR,preL+l+1,preR);
} 

//后序遍历 
void dfs(int k)
{
	if(T[k].left!=-1)
		dfs(T[k].left);
	if(T[k].right!=-1)
		dfs(T[k].right);
	cout<<T[k].data<<" ";
}

//层序遍历
void bfs()
{
	queue<int> q;
	q.push(0);
	while(q.size())
	{
		int x=q.front();q.pop();
		cout<<x<<" ";
		if(T[x].left!=-1)
			q.push(T[x].left);
		if(T[x].right!=-1)
			q.push(T[x].right);
	}
} 

void solve()
{
	int N;cin>>N;
	for(int i=0;i<N;i++)
	{
		int x;cin>>x;
		mp[i]=x;
		in.push_back(x);
	}
	for(int i=0;i<N;i++)
	{
		int x;cin>>x;
		pre.push_back(x);
	}
	
	build(0,N-1,0,N-1);
}

signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int T=1;//cin>>T;
	while(T--) solve();
}