[Home]
[Contents]
[Chapter]
[Previous Algorithm]
[Next Algorithm]


B-tree data structure (Pascal version available)


typedef struct btnode { /*** B-Tree Definition ***/ int d; /*** number of active entries ***/ typekey k[2*M]; /*** Keys ***/ struct btnode *p[2*M+1]; /*** Pointers to subtrees ***/ } node, *btree;

C source (342.data.c) Pascal source (342.data.p)



© Addison-Wesley Publishing Co. Inc.