**January 8, 2021**

Following are the algorithms that can be used to construct a Decision Tree:

**Iterative Dichotomizer (ID3):**This algorithm uses Information Gain as the basis for selecting root nodes and splitting them. It is used for classification problems and works only with categorical data.**C4.5:**This is an improved version of ID3 algorithm as it works with both categorical and continuous variables. It is used for classification problems.**Classification and Regression Algorithm(CART):**This is the most popular algorithm for constructing Decision Trees. It uses Gini Impurity, as default value, for selecting and splitting root nodes, but also works with Information gain. It can be used for both regression and classification problems

by : Monis Khan

**Quick Summary**:

Following are the algorithms that can be used to construct a Decision Tree: Iterative Dichotomizer (ID3): This algorithm uses Information Gain as the basis for selecting root nodes and splitting them. It is used for classification problems and works only with categorical data. C4.5: This is an improved version of ID3 algorithm as it works […]