Decision trees are a useful way of collecting and storing huge amounts of decision-making information for computers.
Decision trees are a type of binary tree. They're made up of nodes, which we draw as rounded squares. An internal node has two links down to its child nodes and contains a yes-or-no question. A leaf node has no links and contains an answer.