B+ tree
Jump to navigation
Jump to search
English
[edit]
Noun
[edit]- (computing theory) An m-ary tree data structure with a variable but often large number of children per node. It can be viewed as a B-tree in which each node contains only keys (not key–value pairs), and to which an additional level is added at the bottom with linked leaves.