通过后序和中序建立二叉树

通过后序和中序建立二叉树

代码

#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<cmath>
#include<cstring>
#define inf 0x3f3f3f3f
#define pb push_back
#define lowbit(x) x&-x 
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
typedef vector<int> vi;
typedef vector<vi> vii;
const int N = 5e5 + 10;
int n ,p[100],q[100];

struct{
    int e,l,r;
}node[N];

int build(int xa , int ya , int xb , int yb )//建树
{
    if(xa > ya) return -1;
   int k = q[yb],css = 0;
    for(int i = xa ; i <= ya ; i ++){
       	css ++;
        if(p[i] == k){
           break;
       }
    }

    node[k].l = build(xa , xa + css - 2 , xb , xb + css - 2);
    node[k].r = build(xa + css  , ya , xb + css - 1 , yb - 1);
    return k;
}
int cn = 0,ct = 0;
int ssa[1000],ssb[10000];
void dfs1(int k,int tt)
{
//	cout<<k<<" "<<cn<<" "<<tt<<endl;
    if(k== -1) return;
    if(cn <= tt) ssa[cn++] = k; 
    dfs1(node[k].l,tt + 1);
    dfs1(node[k].r,tt + 1);
}
void dfs2(int k,int tt)
{
    if(k == -1) return;
    if(ct <= tt) ssb[ct++] = k; 
    dfs2(node[k].r,tt + 1);
    dfs2(node[k].l,tt + 1);
}
void solve()
{ 
    //int n;
    cin >> n;
    for(int i = 1 ; i <= n ; i ++) cin >> p[i];
    for(int i = 1 ; i <= n ; i ++) cin >> q[i];
    
    int k  = build(1,n,1,n);//建树
    //cout<<k<<endl;
     dfs1(k,0),dfs2(k,0);
     //cout<<cn<<" sss "<<ct<<endl;
     cout<<"R:";
     for(int i = 0 ; i < cn ; i ++) cout<<" "<< ssb[i];
     cout<<"\nL:";
     for(int i = 0 ; i < ct ; i ++) cout<<" "<<ssa[i];
}


int main()
{
    std::ios::sync_with_stdio(false);
    int tt = 1;
    //cin >> tt;
    while(tt --){
        solve();
    }
    return 0;
}