| Discuss 2-3 Trees |
|
|
|
|
|
|
|
|
|
|
|
|
|
| • | The
advantage is not that the tree is shorter |
|||||||||||
| than
a balanced binary search tree |
||||||||||||
| – | the
reduction in height is actually offset by the |
|||||||||||
| extra
comparisons that have to be made to find |
||||||||||||
| out
which branch to take |
||||||||||||
| – | actually
a binary search tree that is balanced |
|||||||||||
| minimizes
the amount of work required to |
||||||||||||
| support
ADT table operations |
||||||||||||