What is the time complexity of insert function in a hash table using a doubly…

2024

What is the time complexity of insert function in a hash table using a doubly linked list?

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

A.
O(1)
B.
O(n)
C.
O(log n)
D.
O(n log n)

Attempted by 344 students.

Show answer & explanation

Correct answer: A

Answer: a

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

Explore the full course: Coding For Placement