Algorithm to evaluate Postfix expression:
- Scan the input from left to right.
- Move operands on to the Stack until any operator is found.
- If it is an operator, remove operands from stack, perform operation and store the result back to stack.
- Repeat this process until the end of expression has reached.
Expression: 8 2 / 3 + 4 8 * +
