B+ trees

A form of B+ tree — 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.

Ask AI about this wordChatGPTClaudePerplexityGoogle AIGrok

Meanings

noun
  1. pluralplural of B+ tree
Cite this entry
APA

B+ trees. (n.d.). In WatkinsX Dictionary. Retrieved November 4, 2026, from https://dictionary.watkinsx.com/word/B%2B%20trees

MLA

“B+ trees.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/B%2B%20trees. Accessed November 4, 2026.

Chicago

WatkinsX Dictionary, s.v. “B+ trees,” accessed November 4, 2026, https://dictionary.watkinsx.com/word/B%2B%20trees.

Source: B+ trees on Wiktionary, CC BY-SA 4.0.