| Chaining |
|
|
|
|
|
|
|
|
|
|
|
| • | Therefore,
when the linked lists are too long, |
|||||||||
| change
the table size and the manner in which |
||||||||||
| the
key is converted into an index into the hash |
||||||||||
| table |
||||||||||
| • | Do
you notice how we are using a combination |
|||||||||
| of
direct access with the array and quick |
||||||||||
| insert/removal
with linked lists? |
||||||||||
| • | Notice
as well that no data moving happens |
|||||||||
| • | But,
what if 2 or more keys are required? |
|||||||||