Home / Programming MCQs / JAVA MCQs / Question

M

Mr. Dubey • 51.43K Points
Coach

Q. The add and take away methods of TreeSet have a time complexity of

(A) O(n)
(B) O(n + 1)
(C) O(1)
(D) O(log n)

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.