Get App

Java: In Java, which comparison about TreeSet and NavigableSet is accurate?

Difficulty:

Easy

Questions:

1

Time Limit:

2 minutes

Passing Score:

100%

Question

In Java, which comparison about TreeSet and NavigableSet is accurate?

  1. There is no practical difference in behavior, performance, or API design when TreeSet and NavigableSet is involved.
  2. The oldest option related to TreeSet and NavigableSet is always the right production choice regardless of context.
  3. HashSet gives faster average membership checks, while TreeSet adds ordering and nearest-value operations.
  4. Differences around TreeSet and NavigableSet are mostly cosmetic, so correctness and maintainability do not change.

Hint

Focus on the behavior or tradeoff, not just the keyword.

Answer and rationale

Correct answer: C. HashSet gives faster average membership checks, while TreeSet adds ordering and nearest-value operations.

HashSet gives faster average membership checks, while TreeSet adds ordering and nearest-value operations. This is the comparison that usually separates memorization from understanding.

Track: Java