Suppose T is a direct address table, x is a data item, and k is a key (i.e. an array index):
return T[k]
T[x.key] ← x
T[x.key] ← null
Worst-case running time for each of these: O(1)