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

3174 Views

See similar Computing A Level tutors

Related Computing A Level answers

All answers ▸

Write pseudocode for the binary search algorithm and state, with an explanation, it's worst case complexity in big-O notation


Describe the 4 layers of the TCP/IP model


Explain how the even parity system works when transmitting ASCII codes. Include a description of the roles of the sending device and the receiving device during transmission.


Why would you use Assembly Language instead of a normal programming language?


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