The data structure required to check whether an expression contains a – McqOptions

MCQOPTIONS

1.	The data structure required to check whether an expression contains a balanced parenthesis is?
A.	Stack
B.	Queue
C.	Array
D.	Tree
Answer» B. Queue

Discussion

No Comment Found

Related MCQs

The prefix form of an infix expression (p + q) (r * t) is?
What is the result of the following operation?<br><strong>Top (Push (S, X))</strong>
What data structure would you mostly likely see in non recursive implementation of a recursive algorithm?
The data structure required to check whether an expression contains a balanced parenthesis is?