Postfix Enumeration Demonstration Program
A tree representing an algebraic expression is traversed in post order,
and the expression in RPN for the algebraic expression is generated.
-
Each leaf node represents an operand.
-
An internal node is an operator.
-
A post-order traversal is performed over the nodes.
-
In a post-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)
Back
Home