Concept guide · Classical algorithms
How does a decision tree choose a split?
A slower explanation for when the short interview answer is not enough. Start with the intuition, then connect it to the technical idea and the way an interviewer expects you to reason about it.
ML area
Classical algorithms → Core interview concept
Interview format
Core
Question
ML-047
Start with the idea
In simple terms
This question is asking you to explain How does a decision tree choose a split in a way that connects the idea to a real machine-learning decision. Start with the role this concept plays, then explain what changes when the data, target, or deployment situation changes.
Build the answer
How to reason about it
- 1Define the concept before naming algorithms or implementation details.
- 2Connect it to the data, target, decision, or failure mode in the question.
- 3State the assumption or evaluation check that would make the explanation trustworthy.
Go one level deeper
The technical explanation
For each candidate feature and threshold, the tree evaluates how much the split reduces impurity or loss in the child nodes. Classification trees commonly use Gini impurity or entropy; regression trees use a variance or squared-error reduction. The chosen split is greedy, so later pruning, depth limits, minimum leaf sizes, or ensembles are used to control variance. The safest way to understand this topic is to connect the definition to assumptions, data available at prediction time, the decision it supports, and how you would evaluate whether the result is useful.
Mental model
A tree repeatedly partitions the feature space into more homogeneous child regions.
Say this in the interview
For each candidate feature and threshold, the tree evaluates how much the split reduces impurity or loss in the child nodes. Classification trees commonly use Gini impurity or entropy; regression trees use a variance or squared-error reduction. The chosen split is greedy, so later pruning, depth limits, minimum leaf sizes, or ensembles are used to control variance.
Keep preparing