+1 vote
in Data Structures & Algorithms I by (88.2k points)
What is the time complexity of the delete function in the 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 section Hash Tables of Data Structures & Algorithms I

I got this question in an interview.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
The correct choice is (a) O(1)

Explanation: Time complexity of delete function in a hash table is O(1). Condition is that the hash function should be such that the number of collisions should be low.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...