Question 92Asked in BPSC TRE 2.0 (2023) Computer Science Class 11-12

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

  1. AStack
  2. BQueue
  3. CTree
  4. DMore than one of the above
  5. ENone of the above
Show answerHide answer

Correct answer: (A) Stack

Explanation

Infix-to-postfix conversion pushes operators and parentheses onto a stack. It pops them according to precedence and associativity.

From BPSC TRE 2.0 (2023) Computer Science Class 11-12 — Previous Year Paper

This is question 92 of BPSC TRE 2.0 (2023) Computer Science Class 11-12 — Previous Year Paper. See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.