Breadth First Search and Depth First Search

Question

Can anybody give a link for a simple explanation on BFS and DFS with its implementation?

Answer 1

Say you have a tree as follows:

It may be a little confusing because E is both a child of A and F but it helps illustrate the depth in a depth first search. A depth first search searches the tree going as deep (hence the term depth) as it can first. So the traversal left to right would be A, B, D, F, E, C, G.

A breadth first search evaluates all the children first before proceeding to the children of the children. So the same tree would go A, B, C, E, D, F, G.

Hope this helps.