aliensbrain
  • Home
  • Study
  • Quizzes
  • 🎤AI Practicefree
  • Notebooks
  • Community
  • Sign in
  • Data Base Management System
  • Which data structure is needed to convert infix notations...
Multiple choice

Which data structure is needed to convert infix notations to postfix notations?

  1. Linear list

  2. Queue

  3. Tree

  4. Stack

Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

The Shunting-yard algorithm, which converts infix to postfix, uses a stack to hold operators until they can be placed in the output string.

Keep practicing — related questions

  • Which data structure is needed to convert infix notation to postfix notation?
  • Which data structures are used to evaluate a postfix expression?
  • Which among the following algorithms requires the reverse of input string before processing through stacks?
  • Which of the following is the correct conversion of the infix expression A+B*C into postfix expression?
  • (A + B) * C is an example of _________________ type of expression in data structure.
  • Which of the following data structure is linear type?
  • Which of the following types of intermediate codes is used in a single pass compiler?
  • Given an infix expression with parenthesis. If we try to convert this postfix in the resultant expression
Play the full quiz 🎤 Practise this topic out loud

Practice this topic

  • Data Structures and Algorithms (1518 questions)
Advertisement
© Aliensbrain | all rights reserved
  • About
  • Contact
  • Terms and Condition
  • Privacy Policy