Which of the following data structures is needed to convert infix nota – McqOptions

MCQOPTIONS

1.	Which of the following data structures is needed to convert infix notations to postfix notations?
A.	Stack
B.	Linked List
C.	Queues
D.	Tree
Answer» B. Linked List

Discussion

No Comment Found

Related MCQs

Which of the following concepts of OOPS means exposing only necessary information to client?
In c++ how are protected members of a base class accessed in derived class when inherited privately
Which of the following Sorting Algorithm will perform the worst if the numbers are ordered in the opposite form?
In a Doubly Linked list how many nodes have atleast 1 node before and after it?
As aproject, Parag wants to write a code which should increment its value until a condition is satisfied. Which type of structure should he be using?
What collects all the source code for an application and prepares them to be ready for execution?
Which of the following data structures is needed to convert infix notations to postfix notations?
Sorting is not possible by using which of the following methods?
A tree has 5 levels and each node has either 4 children or no children. All nodes on the same level have the same number of children. How many nodes are there in the tree? (Root is Level 1)