Decision trees begin with class counts at a root node. This lesson sets up the exact parent counts that every later split must preserve.
Questions make branches
A decision tree routes rows by feature questions. The root starts with 3 positive and 3 negative rows.
root counts=[3,3]
Why counts come first
The split arithmetic uses class counts, not decimal estimates. Counts are the exact input to every Gini value.
counts→exact fractions
Summary
The parent node is the displayed source. Later splits must preserve these same class totals.
parent total=6