| AVL Trees |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| • | However,
the concept of AVL trees always |
||||||||||||
| includes
implicitly the techniques for balancing |
|||||||||||||
| trees |
|||||||||||||
| – | and
does not guarantee that the resulting tree is |
||||||||||||
| perfectly
balanced (unlike all of the other techniques |
|||||||||||||
| we
have seen so far) |
|||||||||||||
| – | but,
an AVL tree can be searched almost as efficiently |
||||||||||||
| as a
minimum height binary search tree |
|||||||||||||
| – | but
insert and removal are not as efficient |
||||||||||||