 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
| • |
This
approach is beneficial because the total size of
|
|
the
table is now dynamic!
|
|
|
| • |
Each
linked list can be as long as necessary!
|
|
|
| • |
And,
it still let's our Insert operation be almost
|
|
|
instantaneous.
|
|
|
| • |
The
problem with efficiency comes with retrieve
|
|
|
and
delete, where we are required to search a
|
|
|
linked
list of items that are mapped to the same
|
|
|
index
in the hash table.
|
|