# Decision Tree

- Each internal (non-leaf) node denotes a test on features
- Each branch descending from node corresponds to an outcome of the test
- Each external node (leaf) denotes the mentioned simple model

`<f`

`orc`

`=f`

`, wherec`

`is a feature andf`

`is a constant fitted during decision tree induction), the inducted decision tree is a binary tree, so its each non-leaf node has exactly two branches ('true' and 'false') according to the result of the Boolean expression.c`