Prefix Enumeration Demonstration Program
A tree representing an algebraic expression is traversed in pre order,
and the expression in PRE for the algebraic expression is generated.
-
Each leaf node represents an operand.
-
An internal node is an operator.
-
A pre-order traversal is performed over the nodes.
-
In a pre-order traversal, each node is visited
after its descendant nodes are visited.
Source Code of the Postfix Program
Source Code of the PostfixG Program (Graphical Version)
Source Code of the PrefixG Program (Graphical Version)
Jacob's CS 261 Demos
Jacob's CS 261 Home