Metraipolis › archive › dc_387b11d93fe2

2–3 tree — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/2%E2%80%933_tree
License (as archived)
CC-BY-SA-4.0
Archived
2026-11-06T12:40:04.187Z
SHA-256 of the archived text
623a6cc903b18b7bd687c06242502705e12db4bc1bc4e642b2bcde5e8d1d1797
Stable URL of this page
https://metraipolis.com/documento/dc_387b11d93fe2

How to cite

2–3 tree — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/2%E2%80%933_tree (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_387b11d93fe2 (Metraipolis archive dc_387b11d93fe2, sha256 623a6cc903b18b7bd687c06242502705e12db4bc1bc4e642b2bcde5e8d1d1797)
BibTeX
@misc{dc387b11d93fe2,
  title = {2–3 tree — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/2%E2%80%933_tree},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_387b11d93fe2; sha256 623a6cc903b18b7bd687c06242502705e12db4bc1bc4e642b2bcde5e8d1d1797},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/2%E2%80%933_tree. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In computer science, a 2–3 tree is a tree data structure, where every node with children (internal node) has either two children (2-node) and one data element or three children (3-node) and two data elements. A 2–3 tree is a B-tree of order 3. Nodes on the outside of the tree (leaf nodes) have no children and one or two data elements. 2–3 trees were invented by John Hopcroft in 1970. 2–3 trees are required to be balanced, meaning that each leaf is at the same level. It follows that each right, center, and left subtree of a node contains the same or close to the same amount of data.

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 tree» — https://en.wikipedia.org/wiki/2%E2%80%933_tree
Wikidata Q169338: «B-tree of order 3» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q169338
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/2%E2%80%933_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 1383622351, consultata il 2026-11-06T12:37:15.976Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: e1d06e6af02f81d516e4e49bc009f58238ec49aeef8baf7afd4d83d874c5c518