Q1067
Which of the following best represents the time complexity for inserting an element in coalesced hashing?
A.
O(n)
B.
O(1)
AnswerC.
O(n2)
D.
O(n log n)
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board