Get App

Java: Which practice avoids a common mistake with Binary Search Tree?

Difficulty:

Medium

Questions:

1

Time Limit:

2 minutes

Passing Score:

100%

Question

Which practice avoids a common mistake with Binary Search Tree?

  1. Ignore the Binary Search Tree issue and rely on team discipline instead of APIs or contracts.
  2. Do not claim a BST is always fast without mentioning that an unbalanced tree can degrade badly.
  3. Silence the Binary Search Tree problem by using raw types, broad catches, or shared mutable state.
  4. Prefer the version of Binary Search Tree that makes behavior less predictable as long as the code compiles.

Hint

Look for the option that protects correctness instead of hiding the problem.

Answer and rationale

Correct answer: B. Do not claim a BST is always fast without mentioning that an unbalanced tree can degrade badly.

Do not claim a BST is always fast without mentioning that an unbalanced tree can degrade badly. This is a common failure mode in real Java code and a frequent interview follow-up.

Track: Java