What is cost-complexity pruning in CART?

Cost-complexity pruning reduces tree size by adding a penalty for complexity to the loss function.

CART defines an objective function combining impurity and tree complexity: R(T) + α|T|, where |T| is number of leaves. By increasing α, the algorithm prefers simpler trees. It generates a sequence of pruned subtrees and selects the optimal one via cross-validation.