AQA A’Level SLR05 Reverse Polish Notation – Part 2
About this video
AQA Specification Reference
A Level 4.3.3.1
This is the second of two videos on Reverse Polish Notation (RPN). Having covered a lot of concepts in overview in the last video this time we go into more detail with the aid of a step by step example.
Key questions:
- How can you construct a binary tree from the infix form of an expression?
- How can you use post-tree traversal to obtain the RPN form of an infix expression stored in a binary tree?
00:00 Reverse Polish notation - Part 2
00:11 Intro
00:16 A note about this video
00:41 Converting from infix form to Reverse Polish notation (RPN)
06:14 Key questions
06:36 Outro
Last updated: 14.04.25
