Get App

Java: In Java, which comparison about Binary Search Tree is accurate?

Difficulty:

Easy

Questions:

1

Time Limit:

2 minutes

Passing Score:

100%

Question

In Java, which comparison about Binary Search Tree is accurate?

  1. There is no practical difference in behavior, performance, or API design when Binary Search Tree is involved.
  2. The oldest option related to Binary Search Tree is always the right production choice regardless of context.
  3. Differences around Binary Search Tree are mostly cosmetic, so correctness and maintainability do not change.
  4. A BST supports ordered search and range reasoning, while hash structures support fast lookup without natural order.

Hint

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

Answer and rationale

Correct answer: D. A BST supports ordered search and range reasoning, while hash structures support fast lookup without natural order.

A BST supports ordered search and range reasoning, while hash structures support fast lookup without natural order. This is the comparison that usually separates memorization from understanding.

Track: Java