PAT甲级 1066 AVL tree(25)

题目

An AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property. Figures 1-4 illustrate the rotation rules.

![](https://ad.itadn.com/c/weblog/blog-img/images/2025-05-31/YMl2eQXZNmDc6W