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

Related Computing A Level answers

All answers ▸

How do I solve a Karnaugh Map?


In a computer program, a parameter may be passed to a procedure by value. Explain how this method works.


Describe Round Robin Scheduling


Describe a queue data structure.