The Breadth-First search technique is exactly the same as the Depth-First except that the Breadth-First checks each node on a level until it proceeds to the next level. The example below demonstrates this technique with the goal of node ‘c’:

Advantages:
• Always finds the goal
• Good for shallow trees
Disadvantages:
• Often can be slow in deep trees
• Can result in an exhaustive search