In a(n) ____ search, we visit the start node first, then all nodes that are adjacent to it next, then all nodes that can be reached by a path from the start node containing two edges, three edges, and so on.
A) depth-first
B) binary
C) breadth-first
D) linear

Question

Quizplus · Accepted Answer

This description matches a breadth-first search, where nodes are visited level by level from the start node. Depth-first search would involve exploring as far as possible along each branch before backtracking, which is not described here.

In A(n) ____ Search, We Visit the Start Node First