Definitions of b-tree

  1. A multi-way balanced tree.The " B" in B-tree has never been officially defined. It couldstand for " balanced" or " Bayer", after one of the originaldesigners 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 theleaves are also linked sequentially, thus allowing both fastrandom access and sequential access to data.[ Knuth's Art of Computer Programming].[ Example algorithm?]