+1 vote
in Data Structures & Algorithms I by (110k points)
Which data structure is needed to convert infix notation to postfix notation?

(a) Branch

(b) Tree

(c) Queue

(d) Stack

I need to ask this question from Stack Operations topic in section Abstract Data Types of Data Structures & Algorithms I

The question was posed to me in semester exam.

1 Answer

+1 vote
by (412k points)
selected by
Best answer
Right answer is (d) Stack

The best 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.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.