 For nominal features, one may build a stump which contains a leaf for each possible feature value or a stump with the two leaves, one of which corresponds to some chosen category, and the other leaf to all the other categories.For binary features these two schemes are identical.A missing value may be treated as a yet another category.