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 ) $搜索时间的二叉搜索树。这一保证是通过在每次插入或删除操作后可能进行的树重平衡来实现的。本文提出了一种删除算法，与先前报道的删除算法相比，该算法可将删除后的重平衡操作减少19%。