Consider the following hash table operations, and a hash function of key % 10. How many list items
will be compared for the search operations? Collision resolution method: linear probe.
insert: 12
insert: 75
insert: 22
insert: 52
delete: 22
insert: 25
The hash table after these operations is shown below:
search: 25
search: 52
search: 72
none
2,3,5
2,3,3
2,2,4
1,2,4
22//
12
52
75
25
deleted