Logo Data Structures and Algorithms with Object-Oriented Design Patterns in C++
next up previous contents index

Balancing AVL Trees

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.


next up previous contents index

Bruno Copyright © 1997 by Bruno R. Preiss, P.Eng. All rights reserved.