Q36
Which of the following problems can be efficiently solved using a stack?
A.
Evaluating infix expressions
AnswerB.
Finding the shortest path in a graph
C.
Checking for cycles in a graph
D.
Sorting elements
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board