- A Sorting a list of integers
- B Finding the shortest path between two nodes in a graph
- C Evaluating arithmetic expressions in postfix notation
- D Implementing a binary search algorithm
- Share this MCQ
Answer:
B
Explanation:
Answer: b) Finding the shortest path between two nodes in a graph
Explanation
: A queue can be used to implement a breadth-first search algorithm, which is commonly used to find the shortest path between two nodes in a graph.Related Topic: