next up previous
Next: Analysis of Chaining Up: l5 Previous: Problem

Collision Resolution by Chaining



Data corresponding to keys with same hash values are stored in a linked list (as shown in the figure above).

Insert = $\Theta(1)$
Search = $\Theta(l)$
where $l$ is the length of the chain
Delete = $\Theta(l)$
for a singly-linked list


next up previous
Next: Analysis of Chaining Up: l5 Previous: Problem