Metraipolis › archive › dc_3457f04ebcb7
2–3 heap — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/2%E2%80%933_heap
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-11-06T12:40:04.387Z
- SHA-256 of the archived text
ce20ce2f6977f0839c87f67c7b8c551bebdd8c4f7573ef9babe52d8758bc4c39- Stable URL of this page
https://metraipolis.com/documento/dc_3457f04ebcb7
How to cite
2–3 heap — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/2%E2%80%933_heap (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_3457f04ebcb7 (Metraipolis archive dc_3457f04ebcb7, sha256 ce20ce2f6977f0839c87f67c7b8c551bebdd8c4f7573ef9babe52d8758bc4c39)
BibTeX
@misc{dc3457f04ebcb7,
title = {2–3 heap — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/2%E2%80%933_heap},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_3457f04ebcb7; sha256 ce20ce2f6977f0839c87f67c7b8c551bebdd8c4f7573ef9babe52d8758bc4c39},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/2%E2%80%933_heap. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In computer science, a 2–3 heap is a data structure that implements a priority queue. It is a variation on the heap, designed by Tadao Takaoka in 1999. The structure is similar to a Fibonacci heap, and borrows ideas from the 2–3 tree. The time needed for some common heap operations are as follows. Delete-min takes O ( log ( n ) ) {\displaystyle O(\log(n))} amortized time and in the worst case. Decrease-key takes constant amortized time. Insertion takes constant amortized time and O ( log ( n ) ) {\displaystyle O(\log(n))} time in the worst case.
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 heap» — https://en.wikipedia.org/wiki/2%E2%80%933_heap
Wikidata Q4634019: «variation on the heap data structure» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q4634019
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/2%E2%80%933_heap?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 1302465802, consultata il 2026-11-06T12:37:15.978Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 99d72dd41d4ae24f709242afe6f7183f78a78e6f1f53f82c3b02ded5074e3877