 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
| • |
The
AVL tree is a classical method
|
|
|
proposed
by Adelson-Velskii and Landis
|
|
|
|
– |
creates
an “admissible tree” (its original
|
|
|
name!)
|
|
|
|
– |
focuses
on rebalancing the tree locally to the
|
|
|
portion
of the tree affected by insertion and
|
|
|
deletions
|
|
|
|
– |
it
allows the height of the left and right
|
|
|
subtrees
of every node to differ by at most one
|