Breadth-First Search (BFS) explores nodes level by level, starting from the _______ and moving to their _______.

  • Leaf, Siblings
  • Root, Descendants
  • Source, Neighbors
  • Top, Bottom
Breadth-First Search (BFS) explores nodes level by level, starting from the source node and moving to their neighbors. It systematically visits all the neighbors at the current depth before moving on to nodes at the next level.
Add your answer
Loading...

Leave a comment

Your email address will not be published. Required fields are marked *