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?
- A.
O(1)
- B.
O(n)
- C.
O(log n)
- D.
O(n log n)
Attempted by 192 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.