| 2-3 Trees |
|
|
|
|
|
|
|
|
|
|
|
| • | For
example, now, insert 38. |
|||||||||
| • | Again,
we would search the tree to see |
|||||||||
| where
the search will terminate if we had |
||||||||||
| tried
to find 38 in the tree...this would be at |
||||||||||
| node
<39 40>. |
||||||||||
| • | Immediately
we know that nodes contain 1 |
|||||||||
| or 2
data items...but NOT THREE! |
||||||||||
| • | So,
we can't simply insert this new item |
|||||||||
| into
the node. |
||||||||||