A

Admin • 828.03K 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)
  • Correct Answer - Option(D)
  • Views: 14
  • Filed under category Java
  • Hashtags:

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.

Be the first to start discuss.