lws24919的博客

int Binary(int a[],int low,int high,int k){ int mid; if(low<=high) { mid=(low+high)/2; if(a[mid]==k) return mid; else if(a[mid]<k) return Binary(a,mid+1,high,k); else return Binary(a,low,mid-1,k); } else return -1;}时.

BSTNode *BST_Search(BiTree T,ElemType x){ while(T&&T->data!=x) { if(key<T->data) T=T->lchild; else T=T->rchild; } return T;}

折半查找要求线性表具有随机存取的特性。因此仅适用于顺序存储结构，且要求元素按关键字有序排列int Binary(SeqList L，int key){ int low=0,high=L.length-1,mid; while(low<=high) { mid=(low+high)/2; if(L.[mid]==key) return mid; else if(L.[data]>key) high=mid-1; else low=mid+1;