+1 vote
in Data Structures & Algorithms I by (88.2k points)
What is the time complexity of insert function in a hash table using a doubly linked list?

(a) O(1)

(b) O(n)

(c) O(log n)

(d) O(n log n)

My question is taken from Hash Tables in division Hash Tables of Data Structures & Algorithms I

This question was addressed to me in quiz.

1 Answer

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

Easy explanation - Time complexity of insert function in a hash table is O(1). Condition is 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

...