Stack | Set 4 (Evaluation of Postfix Expression)

The Postfix notation is used to represent algebraic expressions. The expressions written in postfix form are evaluated faster compared to infix notation as parenthesis are not required in postfix. We have discussed infix to postfix conversion. In this post, evaluation of postfix expressions is discussed. Following is an algorithm for evaluation postfix expressions. 1) Create a stack to store operands (or values). 2) Scan the given expression and do the following for every scanned element. Stack _ Set 4 (Evaluation of Postfix Expression): https://www.geeksforgeeks.org/stack-set-4-evaluation-postfix-expression/