Course contentsShow
← Computer Science
Lesson 367 of 2,8729. Stacks and QueuesFree lesson

Evaluating Postfix Expressions

Implement a stack-based algorithm to evaluate postfix expressions efficiently.

Evaluating Postfix Expressions

What you'll learn: You'll learn how to use a stack to efficiently evaluate postfix expressions and compute their numeric results.

The Core Idea

Remember that postfix expressions write operators after their operands (like 3 4 + instead of 3 + 4). The beauty of postfix is that it's incredibly easy to evaluate using a stack—no parentheses or operator precedence rules needed!

Here's the algorithm:

  1. Scan the postfix expression from left to right
  2. When you see a number, push it onto the stack
  3. When you see an operator, pop two operands, apply the operator, and push the result back
  4. When finished, the stack contains exactly one value: your answer

Example Walkthrough

Let's evaluate: 5 3 + 8 2 - *

  • See 5 → push 5
  • See 3 → push 3
  • See + → pop 3 and 5, compute 5+3=8, push 8
  • See 8 → push 8
  • See 2 → push 2
  • See - → pop 2 and 8, compute 8-2=6, push 6
  • See * → pop 6 and 8, compute 8*6=48, push 48
  • Result: 48

Why It Works

The stack naturally holds intermediate results. Each operator "consumes" the most recent operands (top of stack) and produces a new value. Since postfix arranges operators in execution order, you never need to look ahead or backtrack.

Key Takeaway: Evaluating postfix expressions uses a stack to process operands and operators sequentially—push numbers, pop-compute-push for operators—resulting in O(n) time complexity with clean, straightforward logic.