Chained-Hash-Delete(T,x)
Delete
x
from the list
T[h(x.key)]
This requires searching from the front of the list to find
prev
.
Q:
How to splice
x
out in
O(1)
time?
A:
Keep lists
doubly linked
:
After the delete: