Infix to Postfix
Operands go straight to the output. Operators wait on a stack until a lower-precedence one arrives.
Stacks for Expressions: Infix to postfix
'3'. An operand goes straight to the output.
Cost
- Best
- O(n)
- Average
- O(n)
- Worst
- O(n)
- Space
- O(n)
Before this
Related
Taught by the same lesson
Stacks for Expressions covers these too, in the same run.