Comparison
Decision Tree learner searches a complete hypothesis space (one capable of representing any possible concept), but it uses an incomplete search method (hill climbing)
Candidate Elimination searches an incomplete hypothesis space (one capable of representing only a subset of the possible concepts), but it does so completely.
Note: DT learner works better in practice