Status Search(BTree &p,int k)         //查找k在p中的位置
{
	int j;
	
	for(j=1;j<=p->keynum&&k>=p->key[j];j++);
	return(j-1);
}   //Search


Result SearchBTree(BTree T,int k)
{
	//在m階B-樹T上查找關(guān)鍵字，返回結(jié)果(pt,i,tag).若查找成功，則特征值tag=1
	//指針pt所指結(jié)點(diǎn)中第i個(gè)關(guān)鍵字等于K;否則返回特征值tag=0,等于k的關(guān)鍵字應(yīng)插入
	//指針pt指的結(jié)點(diǎn)第i和第i+1個(gè)關(guān)鍵字之間
	BTree p,q;
	bool found;
	int i;
	Result v;
	p=T;q=NULL;found=FALSE;i=0;
	while(p&&!found)
	{
		i=Search(p,k);    //在p->recptr[1...keynum]中查找,i使p->key[i]<=k<p->key[i+1]
		if(i>0&&p->key[i]==k)found=TRUE;    //找到時(shí)，令found=TRUE
		else
		{q=p;p=p->ptr[i];/*沒找到時(shí)，走向第i棵子樹*/
		}
	}//while
		if(found)              //找到時(shí)
		{
			v.pt=p;
			v.i=i;
			v.tag=1;
			return(v);
		}
		else                 //沒有找到時(shí)
		{
			v.pt=q;
			v.i=i;
			v.tag=0;
			return(v);
	}
}    //SearchBTree