Review: Hash Tables
l More formally:
n Given a table T and a record x, with key (=
symbol) and satellite data, we need to support:
u Insert (T, x)
u Delete (T, x)
u Search(T, x)
n Donít care about sorting the records
l Hash tables support all the above in
O(1) expected time