1.

What data structure is used when converting an infix notation to prefix notation?(a) Stack(b) Queue(c) B-Trees(d) Linked-listMy question is based upon Application of Stacks in division Application of Stacks of Data Structures & Algorithms II got this question during an interview for a job.

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.



Discussion

No Comment Found

Related InterviewSolutions