CART [1] stands for Classification and Regression Trees
introduced by Breiman. It is also based on Hunt’s algorithm.
CART handles both categorical and continuous attributes to
build a decision tree. It handles missing values.CART uses Gini Index as an attribute selection measure to
build a decision tree .Unlike ID3 and C4.5 algorithms, CART
produces binary splits. Hence, it produces binary trees. Gini
Index measure does not use probabilistic assumptions like ID3,
C4.5. CART uses cost complexity pruning to remove the
unreliable branches from the decision tree to improve the
accuracy