 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
| |
Program
#3
|
|
|
|
|
what
is most important is developing a
|
|
|
technique
for FAST retrieval by either key
|
|
|
value
|
|
|
|
|
which
is why two hash tables are being used
|
|
|
|
|
but...at
the same time we dont want to
|
|
|
duplicate
our data so make sure that the data
|
|
|
only
occurs once and that each node points to
|
|
the
data desired
|
|