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

3367 Views

See similar Computing A Level tutors

Related Computing A Level answers

All answers ▸

Describe the 4 layers of the TCP/IP model


How is different an NFA from a DFA?


How to manually convert a number from decimal into binary?


In Python, write a recursive function that returns the first n Fibonacci numbers.


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