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.
![[Home]](../../images/home_g.gif)
![[Contents]](../../images/contents_g.gif)
![[Chapter]](../../images/chapter_g.gif)
![[Previous Algorithm]](../../images/prevalg_g.gif)
![[Next Algorithm]](../../images/nextalg_g.gif)
C source (342.data.c) 