What is the time complexity of the search function in a hash table using a binary tree?

Category: QuestionsWhat is the time complexity of the search function in a hash table using a binary tree?
Editor">Editor Staff asked 1 month ago

What is the time complexity of the search function in a hash table using a binary tree?
 
(a) O(1)
 
(b) O(n)
 
(c) O(log n)
 
(d) O(n log n)
 
Question is from Hash Tables in division Hash Tables of Data Structures & Algorithms I
 
I had been asked this question in unit test.

1 Answers
Editor">Editor Staff answered 1 month ago

Right choice is (a) O(1)
 
Best explanation: Time complexity of search function in a hash table is O(1). Condition is that the number of collisions should be low.