The question then is how to build a decision-tree classifier, given a set of training
instances. Themost common way of doing so is to use a greedy algorithm, which
works recursively, starting at the root and building the tree downward. Initially
there is only one node, the root, and all training instances are associated with that
node.