Decision trees for binary classification variables grow equally with the Gini impurity measure and Pearson's chi-square test

We show that for binary classification variables, Gini and Pearson purity measures yield exactly the same tree, provided all the other parameters of the algorithms are identical. A counter-example for ternary classification variables is given.