Get App

Java: In Java, which comparison about TreeMap and NavigableMap is accurate?

Difficulty:

Easy

Questions:

1

Time Limit:

2 minutes

Passing Score:

100%

Question

In Java, which comparison about TreeMap and NavigableMap is accurate?

  1. There is no practical difference in behavior, performance, or API design when TreeMap and NavigableMap is involved.
  2. TreeMap is slower than HashMap for pure lookup on average, but it provides ordered operations that hash tables do not.
  3. The oldest option related to TreeMap and NavigableMap is always the right production choice regardless of context.
  4. Differences around TreeMap and NavigableMap 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: B. TreeMap is slower than HashMap for pure lookup on average, but it provides ordered operations that hash tables do not.

TreeMap is slower than HashMap for pure lookup on average, but it provides ordered operations that hash tables do not. This is the comparison that usually separates memorization from understanding.

Track: Java