/* J. Dean Brock, 1998 Written for UNCA CSCI 343 Various useful routines for the B+-tree */ #include #include #include "btree.h" /* Search for record with key 'k'. * Used in search of LEAF nodes */ int SearchLeaf(blockRecT *p, /* Block to search */ char *k, /* Record searched for */ int *val) /* place to store result of search */ /* Returns: 1, if found * 0, otherwise */ { } /* Search for subtree for records handling key 'k' * Used in search of Interior nodes. */ int SearchInt(blockRecT *p, /* Block to search */ char *k) /* Record searched for */ /* Returns: address of subtree */ { }