Data Structures and Algorithms20775 marksConversion from infix to postfix/prefix expression, Evaluati
Explain algorithm for evaluation of postfix expression using stack.
Explain algorithm for evaluation of postfix expression using stack. [5]
In a postfix expression (also called Reverse Polish Notation), operators follow their operands. A stack is used to hold operands until an operator is encountered, at which point the operation is performed. --- 1. Scan the postfix expression from left to right, one symbol at a time. 2. If the scan...