A

Admin • 833K Points
Coach

Q. Which Set implementation is best for frequent insertion and removal without order?

  • (A) TreeSet
  • (B) LinkedHashSet
  • (C) HashSet
  • (D) EnumSet
  • Correct Answer - Option(C)
  • Views: 29
  • Filed under category Java
  • Hashtags: Java Set

Explanation by: Admin

HashSet is efficient for frequent insertion and deletion operations.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.