Metraipolis › archive › dc_9d84fbfbf997
2–3–4 tree — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/2%E2%80%933%E2%80%934_tree
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-11-06T12:40:04.687Z
- SHA-256 of the archived text
c7ea46a98e18bb3d43518ce86317d8e509664ab8cf93e8370b556ef2a5d37d60- Stable URL of this page
https://metraipolis.com/documento/dc_9d84fbfbf997
How to cite
2–3–4 tree — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/2%E2%80%933%E2%80%934_tree (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_9d84fbfbf997 (Metraipolis archive dc_9d84fbfbf997, sha256 c7ea46a98e18bb3d43518ce86317d8e509664ab8cf93e8370b556ef2a5d37d60)
BibTeX
@misc{dc9d84fbfbf997,
title = {2–3–4 tree — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/2%E2%80%933%E2%80%934_tree},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_9d84fbfbf997; sha256 c7ea46a98e18bb3d43518ce86317d8e509664ab8cf93e8370b556ef2a5d37d60},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/2%E2%80%933%E2%80%934_tree. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In computer science, a 2–3–4 tree (also called a 2–4 tree) is a self-balancing data structure that can be used to implement dictionaries. The numbers mean a tree where every node with children (internal node) has either two, three, or four child nodes: a 2-node has one data element, and if internal has two child nodes; a 3-node has two data elements, and if internal has three child nodes; a 4-node has three data elements, and if internal has four child nodes; 2–3–4 trees are B-trees of order 4; like B-trees in general, they can search, insert and delete in O(log n) time. One property of a 2–3–4 tree is that all external nodes are at the same depth. 2–3–4 trees are closely related to red–black trees by interpreting red links (that is, links to red children) as internal links of 3-nodes and 4-nodes, although this correspondence is not one-to-one. Left-leaning red–black trees restrict red–black trees by forbidding nodes with a single red right child, which yields a one-to-one correspondence between left-leaning red–black trees and 2–3–4 trees. Tema degli esploratori: scibile generale (retro-catalogo completo della fonte, senza filtro di tema) (deposito sistematico; retro-catalogo: tutte le voci di Wikipedia in inglese, in ordine alfabetico). Fonte: Wikipedia in inglese, voce «2–3–4 tree» — https://en.wikipedia.org/wiki/2%E2%80%933%E2%80%934_tree Wikidata Q169233: «B-tree of order 4» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q169233 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/2%E2%80%933%E2%80%934_tree?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1346898539, consultata il 2026-11-06T12:37:15.980Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 5eff6fd7816c1490f1cc3d92fbe0772c4dd7201fc000d202a15e3cc45bc32342