Question

Write an pseudo code floor(A key) method for B tree.The function floor returns the biggest key smaller or equal to key.

Answer 1

`Hey,

Note: If you have any queries related to the answer please do comment. I would be very happy to resolve all your queries.

int find_predecessor(struct bnode *node,int val) {
    int i,temp,max = INF;
    for(i=0;i<num-1;i++) {
        if(node->value[i] >= val)
            break;
        if(max > node->value[i]) ｛
            max = ->value[i];
            temp = find_predecessor(node->child[i],val);
    max = (temp>max?temp:max);
        ｝
    }
    return max;
    //when there is no predecess,max is INF.
}

int floor(key)

{

return find_predecessor(root,key);

}

Kindly revert for any queries

Thanks.