2-3 tree

Fetched 2026-10-26 (cache).

Synonyms: k-d tree

Antonyms: k-d tree

Related words from Datamuse; suggestions, not definitions.

Noun

1. {{lb|en|data structure}} A [[tree]] [[data structure]] whose every [[node]] with [[child]]ren (internal node) has either two children and one data element, or three children and two data elements; a [[B-tree]] of [[order]] 3.

Source: Wiktionary · CC BY-SA 4.0 (Wiktionary dump) · cached copy, not a rewrite.