import java.util.Queue; import java.util.concurrent.LinkedBlockingQueue; class BFS { Node n1 = new Node(1); Node n2 = new Node(2); Node n3 = new Node(3); Node n4 = new Node(4); Node n5 = new Node(5); Node n6 = new Node(6); Node n7 = new Node(7); Node n8 = new Node(8); Node n9 = new Node(9); Node n10 = new Node(10); Node n11 = new Node(11); Node n12 = new Node(12); Node n13 = new Node(13); n1.left = n2; n1.right = n3; n2.left = n4; n2.right = n5; n3.left = n6; n3.right = n7; n4.left = n4.right = null; n5.left = n10; n5.right = n11; n6.left = n6.right = null; n7.left = n8; n7.right = n9; n10.left = n12; n10.right = n13; n11.left = n11.right = null; n8.left = n8.right = null; n9.left = n9.right = null; Node root = n1; Queue<Node> queue = new LinkedBlockingQueue<Node>(); queue.add(root); while(!queue.isEmpty()){ Node n = queue.poll(); if(n.left !=null){ queue.add(n.left); } if(n.right!=null){ queue.add(n.right); } } } } class Node{ public Node left; public Node right; public int info; public Node(int info){ this.info = info; this.left = null; this.left = null; } return "" + this.info; } }
Standard input is empty