Expression Tree Demonstration Program
An algebraic expression is represented as a tree and is evaluated.
-
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 ExpressTree Program
Source Code of the ExpressTreeG Program (Graphical Version)
Jacob's CS 261 Demos
Jacob's CS 261 Home