Q965
Which among the following is the worst case time complexity for deleting an element in coalesced hashing?
A.
O(n)
AnswerB.
O(1)
C.
O(n2)
D.
O(n log n)
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board