Vidyalelo
Data Structure · Q6

Hashing

Programming · Data Structure · question 6

Q6

What is the time complexity of searching for an element in a well-distributed hash table using chaining?

A.
O(log n)
B.
O(n)
C.
O(n log n)
D.
O(1)
Answer

Answer: Option D

Solution

Answer: Option D
No explanation is given for this question Let's Discuss on Board