求助,MLE,应该是爆栈但是找不到哪爆了

#include<bits/stdc++.h>
#define MAXN 10005
using namespace std;
int rt;
int siz[MAXN],cnt[MAXN],lc[MAXN],rc[MAXN],tot,val[MAXN];
void insert(int &p,int v)
{
   if(p) ++siz[p];
   //cout<<p<<" "<<v<<endl;
    if(!p)
    {
        siz[++tot]=cnt[tot]=1;
        val[tot]=v;
        p=tot;
        return ;
    }
    if(val[p]==v){++cnt[p];return ;}
    if(val[p]>v)insert(lc[p],v);
    else if(val[p]<v)insert(rc[p],v);
}
int queryfront(int p,int v,int ans)
{
    if(val[p]>=v)
    {
        if(!lc[p])return ans;
        return queryfront(lc[p],v,ans);
    }
    if(!rc[p])val[p];
    return queryfront(rc[p],v,val[p]);
}
int querynext(int p,int v,int ans)
{
    if(val[p]<=v)
    {
        if(!rc[p])return ans;
        return querynext(rc[p],v,ans);
    }
    if(!lc[p])return val[p];
    return querynext(lc[p],v,val[p]);
}
int queryrank(int p,int rk)
{
    if(!p)return 0x7fffffff;
    if(siz[lc[p]]>=rk)return queryrank(lc[p],rk);
    if(siz[lc[p]]+cnt[p]>=rk)return val[p];
    return queryrank(rc[p],rk-siz[lc[p]]-cnt[p]);
}
int queryval(int p,int v)
{
    if(!p)return 0;
    if(v==val[p])return siz[lc[p]];
    if(v<val[p])return queryval(lc[p],v);
    return queryval(rc[p],v)+siz[lc[p]]+cnt[p];
}
int q;
int main()
{
    cin>>q;
    while(q--)
    {
        int op,x;
        cin>>op>>x;
        if(op==1)cout<<queryval(rt,x)+1<<endl;
        if(op==2)cout<<queryrank(rt,x)<<endl;
        if(op==3)cout<<queryfront(rt,x,-0x7fffffff)<<endl;
        if(op==4)cout<<querynext(rt,x,0x7fffffff)<<endl;
        if(op==5)insert(rt,x);
    }
    return 0;
}