Chapter 6: Graphs and Trees
Section 6.2 Trees and Their Representations
Algebraic Experssion Tree
Structure of an Expression Tree:
- Leaf nodes: Represent operands (numbers or variables).
- Internal nodes: Represent operators (e.g., +, -, *, /).
- The root of the tree represents the entire expression.
- Each subtree represents a sub-expression.
The postfix notation (also called Reverse Polish Notation) is a way of writing expressions without parentheses, where the operator follows the operands.