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

3440 Views

See similar Computing A Level tutors

Related Computing A Level answers

All answers ▸

why is the Harvard architecture is sometimes used in preference to the von Neumann architecture and give examples of each system


Explain why it is important to check the email address with JavaScript and again when it reaches the server.


Choose 3 types of malware, describe them and the ways in which they may harm a device.


Describe a difference between an array and a linked list.


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:

© 2025 by IXL Learning