Data Structures and Algorithms
with Object-Oriented Design Patterns in Java 
When an AVL tree becomes unbalanced, it is possible to bring it back into balance by performing an operation called a rotation . It turns out that there are only four cases to consider and each case has its own rotation.
Copyright © 1998 by Bruno R. Preiss, P.Eng. All rights reserved.