AVL Trees II
The two features that make AVL trees important are:
- By setting a maximum allowable difference in the height of any two sub-trees, AVL trees guarantee a minimum level of performance in searching.
- Maintaining a tree in AVL form as new nodes are inserted involves the use of one of a set of four possible rotations. Each of the rotations is confined to a single local area of the tree. The most complex of the rotations requires only five pointer reassignments.