Tree Traversal (cont)
Consider visiting an expression tree like:
NLR: + * 1 3 - * 5 7 9 (prefix-order: useful for building tree)
LNR: 1 * 3 + 5 * 7 - 9 (infix-order: "natural" order)
LRN: 1 3 * 5 7 * 9 - + (postfix-order: useful for evaluation)
Levl: + * - 1 3 * 9 5 7 (level-order: useful for ??)
|