A multi-way balanced tree. The "B" in B-tree haS never been officially defined. It could Stand for "balanced" or "Bayer", after one of the original deSignerS of the algorithmS and Structure. A B-tree iS _not_ (neceSSarily?) a "binary tree". A B+-tree (aS uSed by IBM' SVSAM) iS a B-tree where the leaveS are alSo linked Sequentially, thuS allowing both faSt random acceSS and Sequential acceSS to data. [Knuth' S Art of Computer Programming]. [Example algorithm?] (2000-01-10)
