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

3645 Views

See similar Computing A Level tutors

Related Computing A Level answers

All answers ▸

What are the main differences between different loops when it comes to coding ?


Represent the denary number 5.625 as an unsigned binary fixed point number with three bits before and five bits after the binary point.


What is meant by the term spooling? Give an example of when it can be used.


Describe what you understand by abstraction, and how it is relevant to software engineering.


We're here to help

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

MyTutor is part of the IXL family of brands:

© 2026 by IXL Learning