Expression trees
Expression trees provide an example for different applications of in-order and post-order traversal. We also introduce reverse Polish notation or RPN, and stack calculators.
Expression Trees / Postfix / RPN (6:10)
Additional reading:
And here鈥檚 a cool HP-35 RPN calculator emulator (at least, I think it鈥檚 cool):
Resources
Comprehension check
Consider this expression tree.
- What is the expression yielded by post-order traversal?
- What is the evaluation of this expression?
Answer (expression): + 釀吰僶l % / 銊� 0銊� + 8 0茞 釀吰僶l + - 釀吰� 8 x 釀吰� 茞
Answer (numeric): 8
Copyright 漏 2023鈥�2025 Clayton Cafiero
No generative AI was used in producing this material. This was written the old-fashioned way.