Question

Which of the following is essential for converting an infix expression to the post fix form efficiently ?

• A. An operator stack
• B. An operand stack
• C. An operand stack and an operator stack
• D. A parse tree

Answer 1

The correct option is A An operator stack

An operator stack is essential for converting an infix expression to the post fix form efficiently.

A stack is an abstract data type that serves as a collection of elements, with two principal operations: push, which adds an element to the collection, and pop, which removes the most recently added element that was not yet removed.

Infix expression :-The expression of the form a operator b. When an operator is in-between every pair of operands.

Postfix expression :-The expression of the form a b operator. When an operator is followed for every pair of operands.