code.txt

是当初的数据结构的做业,用的是b+树这一块,非常值得初学者的参考

int  myretv=0;FTNode * myretp=NULL;CListBox *list=(CListBox *)GetDlgItem(IDC_LIST1);
if(subroot->isleaf())
{if(subroot->lkey==EMPTY) subroot->lkey=e;
else if(subroot->ckey==EMPTY)
{if (e >subroot->lkey)  subroot->ckey=e;
else if (e<subroot->lkey) 
{subroot->ckey=subroot->lkey;
subroot->lkey=e;}}
else if (subroot->rkey==EMPTY)
{  if(e< subroot->lkey){
subroot->rkey=subroot->ckey;
subroot->ckey=subroot->lkey;
subroot->lkey=e;}
else if (e >subroot->lkey && e< subroot->ckey)
{subroot->rkey=subroot->ckey;
subroot->ckey=e;}
else if (e >subroot->ckey)
{subroot->rkey=e;}}
else  splitenode(subroot,e,NULL,retval,retptr);}
else {
if (e < subroot->lkey) insert(subroot->left,e,myretv,myretp);
else if(subroot->ckey==EMPTY || subroot->ckey >e) insert(subroot->lcenter,e,myretv,myretp);
else if(subroot->rkey==EMPTY || e < subroot->rkey) insert(subroot->rcenter,e,myretv,myretp);
else if(e>subroot->rkey) insert(subroot->right,e,myretv,myretp);}
if(myretp!=NULL){
if(subroot->ckey==EMPTY){
if(myretv >subroot->lkey){subroot->ckey=myretv;subroot->rcenter=myretp;}
else if(myretv<subroot->lkey){
subroot->ckey=subroot->lkey;subroot->lkey=myretv;
subroot->rcenter=subroot->lcenter;subroot->lcenter=myretp;}}
else if(subroot->rkey==EMPTY){
if(myretv< subroot->lkey)
{ subroot->rkey=subroot->ckey;
subroot->ckey=subroot->lkey;
subroot->lkey=myretv;
subroot->right=subroot->rcenter;
subroot->rcenter=subroot->lcenter;
subroot->lcenter=myretp;}
else if(myretv<subroot->ckey)
{subroot->rkey=subroot->ckey;
subroot->right=subroot->rcenter;
subroot->ckey=myretv;
subroot->rcenter=myretp;}
else if(myretv>subroot->ckey)
{subroot->rkey=myretv;
subroot->right=myretp;}} 
else if(subroot->rkey!=EMPTY)
splitenode (subroot,myretv,myretp,retval,retptr);}
return true;