However, often data are noisy, or a set may be
so small that partitioning it further may not be justified statistically. In this case,
the recursion stops when the purity of a set is “sufficiently high,” and the class of
the resulting leaf is defined as the class of the majority of the elements of the set.
In general, different branches of the tree could grow to different levels.