Breadth-first search (BFS) is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root and explores the neighbor nodes first, before moving to the next level neighbors. (Reference – Wiki)

Example:

Approach:

Take a Empty Queue.

Start from the root, insert the root into the Queue.

Now while Queue is not empty,

Extract the node from the Queue and insert all its children into the Queue.

If you find anything incorrect or you feel that there is any better approach to solve the above problem, please write comment.
__________________________________________________