76.折半查找和二叉排序树查找的算法实现

折半查找(二分查找)

int Binary_Search(SSTable L,ElemType key){
    int low=0,high=L.TableLen-1,mid;
    while (low<=high)
    {
        mid=(low+high)/2;
        if(L.elem[mid]==key)
            return mid;
        eles if(L.elem[mid]>key)
            high=mid-1;
        else
            low=mid+1;
    }
    return -1;
}

二叉排序树查找

BSTNode *BST_Search(BigTree T,ElemType key){
    while(T!=NULL&&key!=T->data){ //树不为空且查找结点值不等于根节点值
        if(key<T->data) T=T->lchild;
        eles T=T->rchild;
    }
    return T;
}

具体知识点参考：https://www.cnblogs.com/gaodiyuanjin/p/18504021