An AVL tree is a binary search tree that guarantees $ O\left( \log n \right ) $ search. The guarantee is obtained at the cost of rebalancing the AVL tree, potentially after every insertion or deletion. This article proposes a deletion algorithm that reduces rebalancing after deletion by 19 percent compared to previously reported deletion algorithms.

翻译：AVL树是一种二叉搜索树，可保证$ O\left( \log n \right ) $的搜索复杂度。这一保证的代价是可能需要在每次插入或删除后对AVL树进行再平衡操作。本文提出了一种删除算法，与先前报道的删除算法相比，该算法将删除后的再平衡操作减少了19%。