Which of the following statement is incorrect with respect to evaluation of infix expression algorithm?
(a) Operand is pushed on to the stack
(b) If the precedence of operator is higher, pop two operands and evaluate
(c) If the precedence of operator is lower, pop two operands and evaluate
(d) The result is pushed on to the operand stack
My enquiry is from Evaluation of an Infix Expression (Not Parenthesized) topic in chapter Application of Stacks of Data Structures & Algorithms I
This question was posed to me in an interview.