Breadth First Search is a method of traversing graphs and trees which travels to each neighbour of each node first.
Example
Under breadth first search the correct order to traverse this graph (in the case of multiple choice taking the first alphabetically) is: A → B → C → E → D → F → G
Example
Under breadth first search the correct order to traverse this graph (in the case of multiple choice taking the first alphabetically) is: a → b → c → d → j → e → f → g → h → i
