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

3648 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?


Describe the difference between passing parameters into a function by reference and by value? Indicating how this may lead to unexpected outputs.


Describe a difference between an array and a linked list.


Write a function in pseudocode that determines if a given string is a palindrome


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:

© 2026 by IXL Learning