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.

Answered by Ellie F. Computing tutor

2809 Views

See similar Computing A Level tutors

Related Computing A Level answers

All answers ▸

What is the difference between simplex, half duplex and full duplex?


What is the difference between validation and verification?


What are the benefits of Reverse Polish Notation and what is it?


One member of a chess club sends a text file saved in Unicode. What meant by the term "Unicode" and why might this be necessary?


We're here to help

contact us iconContact usWhatsapp logoMessage us on Whatsapptelephone icon+44 (0) 203 773 6020
Facebook logoInstagram logoLinkedIn logo
Cookie Preferences