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

Category: QuestionsWhat is the time complexity of insert function in a hash table using a binary tree?
Editor">Editor Staff asked 4 weeks ago

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

1 Answers
Editor">Editor Staff answered 4 weeks ago

Right answer is (a) O(1)
 
The explanation is: Time complexity of insert function in a hash table is O(1) on an average. Condition is that the number of collisions should be low.