Explain how a stack could be used in the process of evaluating an expression in Reverse Polish notation.

Starting at the left hand side of the expression push values onto stack. Each time operator reached in the expression pop the top two values off the stack and apply the operator to them, then push the new value back onto the stack. When the end of the expression is reached the final value on the stack is the final result.

EF
Answered by Ellie F. Computing tutor

3107 Views

See similar Computing A Level tutors

Related Computing A Level answers

All answers ▸

Image a graph. In which instances is it more appropriate to use an adjacency list instead of an adjacency matrix?


What is immediate addressing?


What is the denary equivalent of the hexadecimal number A7?


Describe the process of a binary search.


We're here to help

contact us iconContact ustelephone icon+44 (0) 203 773 6020
Facebook logoInstagram logoLinkedIn logo

© MyTutorWeb Ltd 2013–2025

Terms & Conditions|Privacy Policy
Cookie Preferences