Question
When should a Python developer choose Binary Search Trees deliberately?
- Choose Binary Search Trees mainly when you want to postpone validation and fix issues manually later.
- Choose Binary Search Trees whenever you want the code to look more advanced, even if the design gets less clear.
- Choose Binary Search Trees only to avoid modeling the real data shape or domain contract explicitly.
- Use BST reasoning when interview problems depend on ordered insertion, range queries, or in-order traversal properties.
Hint
Think about the production scenario where the choice genuinely improves the code.
Answer and rationale
Correct answer: D. Use BST reasoning when interview problems depend on ordered insertion, range queries, or in-order traversal properties.
Use BST reasoning when interview problems depend on ordered insertion, range queries, or in-order traversal properties. Interviewers often ask this to see whether you can connect the concept to real design decisions.
Track: Python