- Discrete attributes are grouped in all possible combinations of two groups for binary trees to find the best tree (color = red, blue, green)

- Continuous attributes are sorted and split into two ranges for binary trees to find the best tree (cost = 1.2, 2.4, 3.4)

- Depending on the splitting algorithm, the splitting values are chosen either as the upper values or the midpoints of any two consecutive values.