B-tree data structure
btree = ^node; node = record d : 0..2*M; k : array [1..2*M] of typekey; p : array [0..2*M] of btree end;
C
source (342.data.c)
Pascal
source (342.data.p)
©
Addison-Wesley
Publishing Co. Inc.
![[Home]](../../images/home_g.gif)
![[Chapter]](../../images/chapter_g.gif)
![[Contents]](../../images/contents_g.gif)
![[Previous Algorithm]](../../images/prevalg_g.gif)
![[Next Algorithm]](../../images/nextalg_g.gif)
C source (342.data.c) 