Question Detail

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

linear list
tree
stack
queue

Answer: Option C

Similar Questions :

1. Which sorting method is slowest

Quick sort
Heap sort
Shell sort
Bubble sort

Answer: Option D

2. Which statement we should ignore in structure programming

WHILE-DO
GO-TO
IT-ELSE
SWITCH

Answer: Option B

3. Which data structure is needed to convert infix notations to postfix notations

linear list
tree
stack
queue

Answer: Option C

4. The memory address of the first element of an array is called

floor address
first address
foundation address
base address

Answer: Option D

5. minimum number of stacks of size n required to implement a queue of size n

One
Two
Three
Four

Answer: Option B

Read more from - Data Structure Questions Answers - Chapter 1