What is the worst case time complexity of insertion operation(n =no. of candidates)?

Category: QuestionsWhat is the worst case time complexity of insertion operation(n =no. of candidates)?
Editor">Editor Staff asked 1 month ago

What is the worst case time complexity of insertion operation(n =no. of candidates)?
 
(a) O(1)
 
(b) O(n)
 
(c) O(log n)
 
(d) O(n log n)
 
My doubt is from Trees in section Trees of Data Structures & Algorithms I
 
I have been asked this question in exam.

1 Answers
Editor">Editor Staff answered 1 month ago

Right choice is (a) O(1)
 
The explanation is: The worst case in a bin insert operation occurs when all the candidates are concentrated in one bin. So in this case the time complexity is O(1).