Get App

Java: Which statement about Binary Search Tree is the strongest interview answer?

Difficulty:

Easy

Questions:

1

Time Limit:

2 minutes

Passing Score:

100%

Question

Which statement about Binary Search Tree is the strongest interview answer?

  1. Binary Search Tree is mostly a naming style choice and has little effect on runtime or design.
  2. Binary Search Tree exists mainly to reduce the number of Java files in a project.
  3. A binary search tree keeps smaller keys on one side and larger keys on the other according to its ordering rule.
  4. Binary Search Tree matters only for frontend frameworks, not for core Java applications.

Hint

Start with the core rule behind Binary Search Tree.

Answer and rationale

Correct answer: C. A binary search tree keeps smaller keys on one side and larger keys on the other according to its ordering rule.

A binary search tree keeps smaller keys on one side and larger keys on the other according to its ordering rule. This is the base concept interviewers commonly test first.

Track: Java