-
The internal nodes contain operators
-
The leaves are operands, such as constants or variable names.
The simplest case and the case that we will be considering are when these trees happen to be binary, because all of the operations are binary. It is also possible for a node to have only one child, as is the case with the unary minus operator.
Here is an example of how an expression tree can be evaluated:
