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. The memory address of the first element of an array is called

floor address
first address
foundation address
base address

Answer: Option D

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

One
Two
Three
Four

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. Recursive problems are implemented by

queues
stacks
linked lists
strings

Answer: Option B

5. The complexity of merge sort algorithm is

O(n)
O(log n)
O(n2)
O(n log n)

Answer: Option D

Read more from - Data Structure Questions Answers - Chapter 1