Various criteria have been proposed for deciding which split is best a
t a given node of a binary classification tree. Consider the question.
given a goodness-of-split criterion and the class populations of the
instances at a node, what distribution of the instances between the tw
o children nodes maximizes the goodness-of-split criterion? The answer
s reveal an interesting distinction between the gini and entropy crite
rion.