Breadth-First Search/Traversal in a Binary Tree

Breadth-First Search ( or Traversal) also know as Level Order Traversal.

What is Breadth First Search:

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.
  • Print the extracted node.

Complete Code:Run This Code

Run This Code

Output:
Breadth First Search : 
 5 10 15 20 25 30 35