Which of the following is essential for converting an infix expression to the postfix from efficiently ?
(A) An operator stack
(B) An operand stack
(C) An operand stack and an operator stack
(D) A parse tree
Explanation: Operator stack is used for converting infix to postfix expression such that operators like as +, *, (, ), / are pushed in stack where as operand stack is used for converting Postfix to Prefix evaluation such that operands are 7,2,1,2 etc.
Hence, option (A) is correct.
Quiz of this Question