Improved Deletion From an AVL Tree
<|reference_start|>Improved Deletion From an AVL Tree: An AVL tree is a binary search tree that guarantees $ O\left( \log n \right ) $ search. This guarantee is obtained at the cost of rebalancing the AVL tree, potentially after each insertion or deletion. The proposed deletion algorithm reduces the number of rebalancing operations required after deletion compared to the rebalancing operations required by a ubiquitous deletion algorithm.<|reference_end|>
@article{brown2024comparative,
    title={Comparative Performance of the AVL Tree and Three Variants of the
  Red-Black Tree},
    author={Russell A. Brown},
    journal={arXiv preprint arXiv:2406.05162},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.05162},
    primaryClass={cs.DS}
}