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 the rebalancing required after deletion compared to the rebalancing required after deletion by a previously reported algorithm.

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