Decision Tree, Entropy, Information Gain, Gini Index.
the algorithm is hunting out nodes where the training loss is already high and hence can only be minimized with a small α. On the other hand, nodes where the training loss is smaller, can accommodate a larger penalty term as part of minimization. To get an idea of what values of ccp_alpha could be