Q34
How is a queue typically implemented in a breadth-first search algorithm?
A.
Using a priority queue
B.
Using a circular queue
C.
Using a simple queue
AnswerD.
Using a double-ended queue
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board