| Tree Efficiency |
|
|
|
|
|
|
|
|
|
|
|
| • | With
a binary search tree, |
|||||||||
| – | Because
the maximum number of nodes that can |
|||||||||
| be on
any path is equal to the height of the tree, |
||||||||||
| we
know that the maximum number of |
||||||||||
| comparisons
that the table operations can require |
||||||||||
| is
also equal to the height. |
||||||||||