Write an algorithm that can evaluate a postfix arithmetic expression.
Answers
Answered by
3
Answer:
ohm bro I m making this for the points ..so ignore this brooo
Answered by
1
Explanation:
Algorithm for Evaluation of Postfix Expression
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.
Similar questions