Metraipolis › archive › dc_4fc1e8ff845f
AA tree — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/AA_tree
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-11-06T23:21:25.559Z
- SHA-256 of the archived text
e2251f7f30419f4da557c1a749e7845eba245ced37ed1801bb2cc42444305c35- Stable URL of this page
https://metraipolis.com/documento/dc_4fc1e8ff845f
How to cite
AA tree — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/AA_tree (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_4fc1e8ff845f (Metraipolis archive dc_4fc1e8ff845f, sha256 e2251f7f30419f4da557c1a749e7845eba245ced37ed1801bb2cc42444305c35)
BibTeX
@misc{dc4fc1e8ff845f,
title = {AA tree — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/AA_tree},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_4fc1e8ff845f; sha256 e2251f7f30419f4da557c1a749e7845eba245ced37ed1801bb2cc42444305c35},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/AA_tree. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
An AA tree in computer science is a form of balanced tree used for storing and retrieving ordered data efficiently. AA trees are named after their originator, Swedish computer scientist Arne Andersson. AA trees are a variation of the red–black tree, a form of binary search tree which supports efficient addition and deletion of entries. Unlike red–black trees, red nodes on an AA tree can only be added as a right subchild. In other words, no red node can be a left sub-child. This results in the simulation of a 2–3 tree instead of a 2–3–4 tree, which greatly simplifies the maintenance operations. The maintenance algorithms for a red–black tree need to consider seven different shapes to properly balance the tree: An AA tree on the other hand only needs to consider two shapes due to the strict requirement that only right links can be red: 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 «AA tree» — https://en.wikipedia.org/wiki/AA_tree Wikidata Q3490262: «form of balanced tree used for storing and retrieving ordered data efficiently» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q3490262 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/AA_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 1290444271, consultata il 2026-11-06T23:17:54.922Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 77a6e27760ff83e6c320fbda6a6b6dae439384ab608c31c0c763d4d45529db27