Collision Resolution by Chaining U (universe of keys) k K ks· (actual k, ☑ keys) 、。 CHAINED-HASH-INSERT (T,x) 1 insert x at the head of list T[h(x.key) Closed CHAINED-HASH-SEARCH(T,k) addressing 1 search for an element with key k in list T[h(k)] CHAINED-HASH-DELETE(T,x) 1 delete x from the list T[h(x.key)]Collision Resolution by Chaining Closed addressing