Document Open Access Logo

Efficient Top-Down Updates in AVL Trees

Author Vincent Jugé

PDF

File

Thumbnail PDF
PDF
LIPIcs.ESA.2025.49.pdf
  • Filesize: 0.88 MB
  • 15 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Sorting and searching
Keywords
  • AVL trees
  • data structures
  • amortised complexity

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

Since AVL trees were invented in 1962, two major open questions about rebalancing operations, which found positive answers in other balanced binary search trees, were left open: can these operations be performed top-down (with a fixed look-ahead), and can they use an amortised constant number of write operations per update? We propose an algorithm that solves both questions positively.

Cite As Get BibTex

Vincent Jugé. Efficient Top-Down Updates in AVL Trees. In 33rd Annual European Symposium on Algorithms (ESA 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 351, pp. 49:1-49:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ESA.2025.49

Author Details

Vincent Jugé
  • LIGM, CNRS, Univ Gustave Eiffel, Marne-la-vallée, France
  • IRIF, Université Paris-Cité & CNRS, France

References

  1. Georgii Adel’son-Velskii and Evgenii Landis. An algorithm for organization of information. In Doklady Akademii Nauk, volume 146(2), pages 263-266. Russian Academy of Sciences, 1962. Google Scholar
  2. Mahdi Amani, Kevin Lai, and Robert Tarjan. Amortized rotation cost in AVL trees. Information Processing Letters, 116(5):327-330, 2016. URL: https://doi.org/10.1016/J.IPL.2015.12.009.
  3. Norbert Blum and Kurt Mehlhorn. On the average number of rebalancing operations in weight-balanced trees. Theoretical Computer Science, 11:303-320, 1980. URL: https://doi.org/10.1016/0304-3975(80)90018-3.
  4. Leonidas Guibas and Robert Sedgewick. A dichromatic framework for balanced trees. In 19th Annual Symposium on Foundations of Computer Science (FOCS), pages 8-21. IEEE Computer Society, 1978. URL: https://doi.org/10.1109/SFCS.1978.3.
  5. Bernhard Haeupler, Siddhartha Sen, and Robert E Tarjan. Rank-balanced trees. ACM Transactions on Algorithms (TALG), 11(4):1-26, 2015. URL: https://doi.org/10.1145/2689412.
  6. Thomas Hibbard. Some combinatorial properties of certain trees with applications to searching and sorting. Journal of the ACM, 9(1):13-28, 1962. URL: https://doi.org/10.1145/321105.321108.
  7. Vincent Jugé. Grand-children weight-balanced binary search trees. In 19th International Symposium on Algorithms and Data Structures (WADS), volume 349 of LIPIcs, pages 14:1-14:20, 2025. URL: https://doi.org/10.4230/LIPICS.WADS.2025.14.
  8. Tony Lai and Derick Wood. A top-down updating algorithm for weight-balanced trees. International Journal of Foundations of Computer Science, 4(4):309-324, 1993. URL: https://doi.org/10.1142/S0129054193000201.
  9. Jürg Nievergelt and Edward Reingold. Binary search trees of bounded balance. In 4th Annual ACM Symposium on Theory of Computing (STOC), pages 137-142. ACM, 1972. URL: https://doi.org/10.1145/800152.804906.
  10. Hendrik Olivié. A study of balanced binary trees and balanced one-two trees. Universitaire Instelling Antwerpen (Belgium), 1980. Google Scholar
  11. Hendrik Olivié. A new class of balanced search trees: half-balanced binary search tress. RAIRO. Informatique théorique, 16(1):51-71, 1982. URL: https://doi.org/10.1051/ita/1982160100511.
  12. Daniel Sleator and Robert Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32(3):652-686, 1985. URL: https://doi.org/10.1145/3828.3835.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact