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

(a) O(1)

(b) O(n)

(c) O(log n)

(d) O(n log n)

This key question is from Hash Tables in portion Hash Tables of Data Structures & Algorithms I

This question was addressed to me during an online exam.

1 Answer

+1 vote
by (737k points)
selected by
 
Best answer
Right option is (a) O(1)

The best 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

...