A decision tree is a flow-chart-like tree structure, where
each internal node is denoted by rectangles, and leaf nodes are
denoted by ovals. All internal nodes have two or more child
nodes. All internal nodes contain splits, which test the value of
an expression of the attributes. Arcs from an internal node to its
children are labeled with distinct outcomes of the test. Each
leaf node has a class label associated with it