Which data structure is needed to convert infix notation to postfix notation?

A. Branch

B. Tree

C. Queue

D. Stack

Correct Answer is :

D. Stack

Explanation

The Stack data structure is used to convert infix expression to postfix expression. The purpose of stack is to reverse the order of the operators in the expression. It also serves as a storage structure, as no operator can be printed until both of its operands have appeared.