previous | index | next

Expression Trees

Consider the Scheme expression
          (+ 1 (* 2 (- 3 5)))
Since the operator precedes the operands, we say the expression is in prefix form.

The corresponding expression in infix form:

          (1 + (2 * (3 - 5)))
This expression can be represented using an expression tree:
          

previous | index | next