AVL TREES - Introduction to Java Programming: Comprehensive Version - page 965

CHAPTER

26

AVL T REES

Objectives

To know what an AVL tree is (§26.1).

■

To understand how to rebalance a tree using the LL rotation,
LR rotation, RR rotation, and RL rotation (§26.2).

■

To design the AVLTree class by extending the BST class (§26.3).

■

To insert elements into an AVL tree (§26.4).

■

To implement tree rebalancing (§26.5).

■

To delete elements from an AVL tree (§26.6). ■

To implement the AVLTree class (§26.7).

■

To test the AVLTree class (§26.8).

■

To analyze the complexity of search, insertion, and deletion operations
in AVL trees (§26.9).

■