8.6 Recursive binary splitting

So, take a top-down, greedy approach known as recursive binary splitting:

• top-down because it begins at the top of the tree and then successively splits the predictor space

• greedy because at each step of the tree-building process, the best split is made at that particular step, rather than looking ahead and picking a split that will lead to a better tree in some future step