Evaluation of postfix expression : Using stack

Expression Representation Techniques :

  1. Infix Expression
  2. Prefix Expression
  3. Postfix Expression

Evaluation of Postfix Expression : [ Click Here ]

Expression Example Note
Infix a + b Operator Between Operands
Prefix + a b Operator before Operands
Postfix a b + Operator after Operands

Generally postfix expressions are free from Operator Precedence thats why they are preferred in Computer system.Computer System Uses Postfix form to represent expression. Following is the example that shows evaluation of the Postfix expression using stack as data structure.

Using Stack Evalution of Postfix Expression using Stack Algorithm