|
B树的基本操作 #define M typedef struct BTNode{ int keynum; struct BTNode *parent; KeyType key[m+]; struct BTNode *ptr[m+]; Record *recptr[m+]; }BTNode *bTree; typedef struct{ BTNode *pt; int I; int tag; }//Result; Result SearchBTree(Btree T KeyType K){ p=T; q=NULL; found=FALSE; i=; while(p&&!found){ i=Search(pk); if(i>&&p>key[i]==k) found=TRUE; else{q=p;p=p>ptr[i];} } if(found) return (pI); else return (qI); }//SearchBTree 返回《数据结构》考研复习精编 [] [] [] [] [] [] |
