Expressiveness
		n Decision trees can express any function of the input attributes. n E.g., for Boolean functions, truth table row → path to leaf: n Trivially, there is a consistent decision tree for any training set with one path to leaf for each example (unless f nondeterministic in x) but it probably won't generalize to new examples n Prefer to find more compact decision trees