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

3281 Views

See similar Computing A Level tutors

Related Computing A Level answers

All answers ▸

What are higher order functions in functional programming? How does the 'map' function work and why is it a higher order function?


State the main features of a tree


Show how the decimal number -183 would be represented as an 8-bit two's complement arithmetic


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


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