+1 vote
in Data Structures & Algorithms I by (110k points)
Which of the following data structure is used to convert postfix expression to infix expression?

(a) Stack

(b) Queue

(c) Linked List

(d) Heap

My query is from Application of Stacks in section Application of Stacks of Data Structures & Algorithms I

This question was addressed to me in a national level competition.

1 Answer

+1 vote
by (408k points)
selected by
Best answer
Correct option is (a) Stack

Best explanation: To convert the postfix expression into infix expression we need stack. We need stack to maintain the intermediate infix expressions. We use stack to hold operands.

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.