我的double array trie

 最近在看aoe的datrie结构，想实现一个，由于才疏学浅，花了几天时间的代码时间复杂度却是指数级（网上有nlogn），太让我伤心了。希望各位有研究的高手能够不吝赐教。下面是代码（写的比较傻瓜）：

#include "DASTrie.h"

dastrie::dastrie():MemUse(BC_INIT_SIZE+TAIL_INIT_SIZE+TEMP_INIT_SIZE),
                   BC((int*)malloc(sizeof(int)*BC_INIT_SIZE)),
                   TAIL((char*)malloc(sizeof(char)*TAIL_INIT_SIZE)),
                   TEMP((char*)malloc(sizeof(char)*TEMP_INIT_SIZE)),
                   BC_pos(1),
                   TAIL_pos(2),
                   BC_max(BC_INIT_SIZE/2-1),
                   TAIL_max(TAIL_INIT_SIZE-1)

{


    for(int i=0;i<BC_INIT_SIZE;i++)
    BC[i]=0;
    setbase(1,1);

    memset(TAIL,0,TAIL_INIT_SIZE);
    memset(TEMP,0,TEMP_INIT_SIZE);
/*  TAIL[0]=TAIL[1]=TAIL_ENDUP_SIGN;*/

    }


dastrie::~dastrie(){
    free(BC);
    free(TAIL);
    free(TEMP);
}

void dastrie::setbase(int pos,int baseval){
    while(pos>=BC_max)
        realloc_BC();
    if(pos>BC_pos)
        BC_pos=pos;
    BC[2*pos]=baseval;
}

void dastrie::setcheck(int pos,int checkval){

    while(pos>=BC_max)
        realloc_BC();

    if(pos>BC_pos)
        BC_pos=pos;
    BC[2*pos+1]=checkval;
}

//#define getbase(y) (y>this->BC_pos ? 0:this->BC[2*y])
int dastrie::getbase(int pos){

    //if (pos<0){printf("getbase()can not recive a negitive operator!!!%d" ,pos),exit(0);}
    if(pos>BC_pos)
        return(0);
    else return(BC[2*pos]);


}

int dastrie::getcheck(int pos){
    //if (pos<0){printf("getcheck()can not recive a negitive operator!!!%d",pos),exit(0);}
    if(pos>BC_pos)
        return(0);
    else return(BC[2*pos+1]);
}

void dastrie::TAIL_insert(char* remain,int pos){

    int i=0;
    int len=strlen(remain);
    while((pos+len)>=TAIL_max-1){
        /*printf("%s:need=%d max=%d\n",__FUNCTION__,pos+strlen(remain),TAIL_max);*/
        /*while_num++;*/
        realloc_TAIL();
    }
    memcpy(TAIL+pos,remain,len);
//  while(*(remain+i)!='\0')
//      TAIL[pos++]=*(remain+i++);

    if(pos+len>TAIL_pos)
        TAIL_pos=pos+len;


}

void dastrie::getTAIL(int pos){
    if(pos>TAIL_pos)
        fprintf(stderr,"TAIL访问越界");
    int i=0;
    while(TAIL[pos]!=TAIL_ENDUP_SIGN)
        TEMP[i++]=TAIL[pos++];
    TEMP[i++]=TAIL_ENDUP_SIGN;
    TEMP[i]='\0';


}

void dastrie::realloc_BC(){
    int pre_bc,i=0;
    pre_bc=BC_max;
    BC_max+=BC_INCREASE_SIZE/2;
    if((BC=(int*)realloc(BC,sizeof(int)*((BC_max+1)*2)))==NULL)
        {printf("BC再分配出错");exit(-1);}
    for(i=2*(pre_bc+1);i<2*(BC_max+1);i++)
        BC[i]=0;
#ifdef DEBUG
    {printf("BC_MAX=%d",BC_max);
    printf("BC REALLOCed\n");}
#endif
}

void dastrie::realloc_TAIL(){
    int i,pre_tail=TAIL_max;
    TAIL_max+=TAIL_INCREASE_SIZE;

    if((TAIL=(char*)realloc(TAIL,sizeof(char)*(TAIL_max+1)))==NULL)
    {printf("TAIL 再分配出错！");exit(-1);}
    for(i=pre_tail;i<TAIL_max;i++)
        TAIL[i]='\0';
#ifdef DEBUG
        printf("tail_max=%d,TAIL_REALLOCED\n",TAIL_max);
#endif
}



bool dastrie::BuildTrie(const char *textname){
    FILE* fp;char buff[1025];int i=0;
    fp=fopen(textname,"r");

    while(i<KEYNUMBER&&!feof(fp))
    {   fscanf(fp,"%s",buff);
     /*  printf("%s\n",buff);*/
      if(!strcmp(buff,"withdraw"))
          int uuuu=0;
        insertkey(buff);
        //printf("bc=%d,tail=%d\n",BC_max,TAIL_max);
        i++;
    }
//
//   printf("while=%d",while_num);
//

return true;
}



bool dastrie::SearchKey(char *keyinput){
    int h=0,s=1;
    int t;
    char* key=(char* )malloc(sizeof(char)*sizeof(keyinput+1));
    strcpy(key,keyinput);
    strcat(key,"#");
    while(1){
        //while_num++;
        t=getbase(s)+key[h];
        if(t>BC_pos||getcheck(t)!=s)
            return(false);
        if(getbase(t)==-1)               //已经匹配终止符(本版本为#)到达终点
            return true;
        if(getbase(t)<0)                 //到达separate node
            break;
        s=t;
        h++;
    }


    getTAIL(-getbase(t));
    if(!strcmp(TEMP,(key+h+1)))
       return true;
    return(false);
}


void dastrie::insertkey(char* key)
{
    int h=0,s=1,i;
    int t;
    strcat(key,"#");
    while(1){
        //while_num++;
        t=getbase(s)+key[h];

        if(getcheck(t)!=s)
        {A_Insert(s,key+h);return;}
        if(getbase(t)==-1)                 //如果是-1表示匹配了一个以#结尾的字串，即已经存在
            return;
        if(getbase(t)<-1)                 //到达separate node
            break;
        s=t;
        h++;
    }


    getTAIL(-getbase(t));

    int no=mycmp(TEMP,key+h+1);
    if(no==-1)
        return;//already in our list,no need to insert
    char* samepre=(char*)malloc(sizeof(char)*(no+1));
    for(i=0;i<no;i++)
        samepre[i]=TEMP[i];
    samepre[i]='\0';
    char *temp1=(char*)malloc(sizeof(char)*(strlen(key+h+1)-no+1));
    for(i=0;i<=strlen(key+h+1)-no;i++)
        temp1[i]=(key+h+1)[i+no];

    char *temp2=(char*)malloc(sizeof(char)*(strlen(TEMP)-no+1));
    for(i=0;i<=strlen(TEMP)-no;i++)
        temp2[i]=TEMP[i+no];

    B_Insert(t,samepre,temp1,temp2);
//  return(false);
    free(samepre);
    free(temp1);
    free(temp2);
}


void dastrie::fprint_info()
{
    FILE* fp;
    fp=fopen("d:\\info.txt","w+");
    fprintf(fp,"BC:");
    for(int i=0;i<BC_max;i++)
        fprintf(fp,"%d  ",BC[i]);
    fprintf(fp,"\n");
    fprintf(fp,"TAIL:\n");
    for(int i=0;i<TAIL_max;i++)
        fprintf(fp,"%c ",TAIL[i]);
    fprintf(fp,"\n");
    fprintf(fp,"mem use:%ld",MemUse);
}

void dastrie::A_Insert(int pos,char*aa){
    ASSERT(pos>0);
    int t=getbase(pos)+aa[0];  //t为本次应该插入的位置
    if(getcheck(t)==0){                    //希望插入的位置是空的,皆大欢喜
        setcheck(t,pos);
        setbase(t,-TAIL_pos);
        TAIL_insert(aa+1,TAIL_pos);

        }
    else{                                 //希望插入的位置是被占用的,要'强拆',代价比较大
        vector<int> v1;
        vector<int> v2;
        set_list(pos,&v1);
        set_list(getcheck(t),&v2);
        if(v1.size()+1<v2.size()&&pos!=1){

            pos=MODIFY(pos,pos,aa[0],v1);
            setcheck(getbase(pos)+(int)aa[0],pos);
            setbase(getbase(pos)+(int)aa[0],-TAIL_pos);
            TAIL_insert(aa+1,TAIL_pos);

        }
        else{
            pos=MODIFY(pos,getcheck(t),NULL,v2);
            setcheck(t,pos);
            setbase(t,-TAIL_pos);

            TAIL_insert(aa+1,TAIL_pos);}

        }


}

void dastrie::B_Insert(int pos,char* pre,char* aremain,char* bremain){
    int old_tailpos=-getbase(pos);
    TAIL_RESET(old_tailpos);
    for(int i=0;i<strlen(pre);i++){
        vector<int> vv;
        vv.push_back(pre[i]);
        setbase(pos,X_CHECK(vv));
        setcheck(getbase(pos)+pre[i],pos);
        pos=getbase(pos)+pre[i];
    }
    vector<int> vv;
    vv.push_back(aremain[0]);
    vv.push_back(bremain[0]);
    setbase(pos,X_CHECK(vv));//

    setcheck(getbase(pos)+aremain[0],pos);
    if(*(aremain+1)=='\0')
        setbase(getbase(pos)+aremain[0],-1);
    else{
        setbase(getbase(pos)+aremain[0],-TAIL_pos);
    TAIL_insert(aremain+1,TAIL_pos);
    }
    setcheck(getbase(pos)+bremain[0],pos);
    if(*(bremain+1)=='\0')
        setbase(getbase(pos)+bremain[0],-1);
    else{
        setbase(getbase(pos)+bremain[0],-old_tailpos);
        TAIL_insert(bremain+1,old_tailpos);}

}

void dastrie::set_list(int pos,vector<int> *pvlist)  //找到某个pos的所有出边，放入vector中
{
    if (getbase(pos)<0)
        return;
    for(int i=0;i<256;i++)
        if(getcheck(getbase(pos)+i)==pos)
            pvlist->push_back(i);
}

int dastrie::X_CHECK(vector<int> vv)      //找到一个合适的值n，满足n>0且对于vector中的所有c，check[n+c]==0.如果找不到，返回-1.
{vector<int>::iterator p;
    for(int i=1;i<BC_max;i++)
        {for(p=vv.begin();p<vv.end();p++)
            if(getcheck(*p+i)!=0)
                break;
            if (p==vv.end())
                return i;

        }
    return(-1);
}


void dastrie::TAIL_RESET(int pos){
    while(TAIL[pos]!=TAIL_ENDUP_SIGN)
        TAIL[pos++]=0;
    TAIL[pos]=0;
}



int dastrie::MODIFY(int current_s,int change_s,char ch,vector<int> int_v){
    int old_base=getbase(change_s);
    vector<int> vv;
    vv=int_v;
    if(ch!=NULL)
        vv.push_back((int)ch);
    setbase(change_s,X_CHECK(vv));
    for(vector<int>::iterator i=int_v.begin();i<int_v.end();i++){
        int t=old_base+*i;
        int t_new=getbase(change_s)+*i;
        setbase(t_new,getbase(t));
        setcheck(t_new,change_s);
        if(getbase(t)>0)
        {
            for(int j=0;j<256;j++)
                if(getcheck(getbase(t)+j)==t)
                    setcheck(getbase(t)+j,t_new);

        }


        setbase(t,0);//释放旧的节点
        setcheck(t,0);
        if(t=current_s&&current_s!=change_s)
            current_s=t_new;
    }


    //return current_s; //?????????????????????????????????????????????//


    return current_s;

}

请大家看看我的复杂度怎么能降下来，thx。

ps：我知道可以把空闲节点连接成双向链表，但是时间复杂度不会降那么多吧？