R

Ram Sharma • 3.40K Points
Extraordinary

Q. Which implementation is preferred for large, sorted data without duplicates?

  • (A) ArrayList
  • (B) HashSet
  • (C) TreeSet
  • (D) Vector
  • Correct Answer - Option(C)
  • Views: 9
  • Filed under category Java
  • Hashtags:
Explanation by: Ram Sharma
`TreeSet` is ideal for large sorted collections without duplicates.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.