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' s VSAM) 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)
