data structure

Algorithm for Evaluation of Postfix Expression Create an empty stack and start scanning the postfix expression from left to right. If the element is an operand, push it into the stack. If the element is an operator o, pop twice and get A and B respectively. Calculate BOA and push it back to the stack. When the expression is ended, the value in the stack is the final answer. Evaluation of a postfix expression using a stack is explained in below example: - ** 2 10 + 96.1 pop 10 puh2 pash 10 pop 2 push 9 push 6 pop 6 pop Pop 3 pop 12 pop wer: 4 push 2 + 10 - 12 puh9 - 6-3 push 12/3=4 6 10 9 3 2 12 12 12 OPERATOR 0 ** I +,- INFIX FORMAT (OPERAND OPERATOR OPERAND) 2 + 3 > 5 OPERAND OPERATOR OPERAND 2 1 EX2 I 3*5+2 1542 17 EX3 4 * (2 +3) - 1 PREFIX [ OPERATOR OPERAND OPERAND) EX1 2 + 3 + 23 EX2 3*5+2 *35 +2 + *352 POSTFIX (OPERAND OPERAND OPERATOR) EX1 2 + 3 2 3 + EX2 3*5+2 3.5* +2