Q26
Which traversal algorithm is guaranteed to visit all nodes at least once?
A.
Neither BFS nor DFS
B.
Depth-First Search (DFS)
C.
Both BFS and DFS
AnswerD.
Breadth-First Search (BFS)
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board