Which of the following is essential for converting an infix expression into postfix?
a - An operator stack
b - An operand stack
c - both a and b
d - A parse tree
I understand that you do not require an operand stack; only operator stack can do the job. But don't the parse tree also qualify for the answer?