closed by
800 views
4 votes
4 votes
closed as a duplicate of: GATE CSE 1997 | Question: 1.7
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?
closed by

Related questions

28 votes
28 votes
3 answers
2
Kathleen asked Sep 29, 2014
8,547 views
Which of the following is essential for converting an infix expression to the postfix form efficiently?An operator stackAn operand stackAn operand stack and an operator s...