+1 vote
in Data Structures & Algorithms I by (110k points)
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 Answer

+1 vote
by (672k points)
selected by
 
Best answer
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).

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...