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 answers both questions positively.
Cite
@article{arxiv.2411.09531,
title = {Efficient top-down updates in AVL trees},
author = {Vincent Jugé},
journal= {arXiv preprint arXiv:2411.09531},
year = {2024}
}