Question

What is time complexity of INSERT/DELETE/SEARCH operations if last digit of

number is chosen as the hash code? Justify your answer with examples.​

Answer 1

Explanation:

pports the following operations in Θ(1) time.

insert(x): Inserts an item x to the data structure if not already present.

remove(x): Removes an item x from the data structure if present.

search(x): Searches an item x in the data structure.

getRandom(): Returns a random element from current set of elements