| Discuss 2-3 Trees |
|
|
|
|
|
|
|
|
|
|
|
| • | But,
with binary search trees balance is |
|||||||||
| hard
to maintain |
||||||||||
| – | A 2-3
tree is really a compromise |
|||||||||
| – | Searching
may not be quite as efficient as a |
|||||||||
| binary
tree of minimum height |
||||||||||
| – | but,
it is relatively simple to maintain |
|||||||||