| Tree Efficiency |
|
|
|
|
|
|
|
|
|
|
| • | Trees
that have a linear shape behave no |
||||||||
| better
than a linked list. |
|||||||||
| • | Therefore,
it is best to use variations of the |
||||||||
| basic
binary search tree together with |
|||||||||
| algorithms
that can prevent the shape of the |
|||||||||
| tree
form degenerating. |
|||||||||
| • | Four
variations are the 2-3 tree, 2-3-4
tree, |
||||||||
| red-black
tree and the AVL tree. |
|||||||||
| • | The
first two are “perfectly balanced” trees |
||||||||