BFS(Breadth First search)

–>also called as level order traversal(where you can visit nodes level by level from top to bottom and left to right)

class Node

{

int key;

Node left,right;

Node(int item)//item=1

{

key=item;

left=right=null;

}

}

class Breadth

{

Node root;

public void bfstraversal(Node root)

{

if(root==null)

return;

Queue<Node> queue=new LinkedList<>();

queue.add(root);

while(!queue.isEmpty())

{

Node current=queue.poll();//remove the front element

System.out.println(current.key+” “);

if(current.left !=null) queue.add(current.left);

if(current.right !=null) queue.add(current.right);

}

}

public static void main(String args[])

{

Breadth tree=new Breadth();

tree.root=new Node(1);

tree.root.left=new Node(2);

tree.root.right=new Node(3);

tree.root.left.left=new Node(4);

tree.root.left.right=new Node(5);

tree.root.right.right=new Node(6);

tree.bfstraversal(tree.node);

}

}