 The leaves of a binary expression tree are operands, such as constants or variable names, and the other nodes contain operators.These particular trees happen to be binary, because all of the operations are binary, and although this is the simplest case, it is possible for nodes to have more than two children.It is also possible for a node to have only one child, as is the case with the unary minus operator.