+1 vote
in Data Structures & Algorithms I by (110k points)
What data structure is used when converting an infix notation to prefix notation?

(a) Stack

(b) Queue

(c) B-Trees

(d) Linked-list

My question is based upon Application of Stacks in division Application of Stacks of Data Structures & Algorithms I

I got this question during an interview for a job.

1 Answer

+1 vote
by (444k points)
selected by
Best answer
Right choice is (a) Stack

For explanation: First you reverse the given equation and carry out the algorithm of infix to postfix expression. Here, the data structure used is stacks.

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.