B-树查找操作:
ResultSearchBTree(BtreeT,KeyTypeK){
p=T;q=NULL;found=FALSE;i=0;
while(p&&!found){
n=p->keynum;i=Search(p,K);//在p->key[1..keynum]中查找i使得
:p->key[i]<=K<p->key[i+1]
if(i>0&&p->key[i]==K)found=TRUE;
else{q=p;p=p->ptr[i];}
}
if(found)return(p,i,1);
elsereturn(q,i,0);
}//SearchBTree