Completed BFS (Level Order Traversal)

Author: whamsy

src/trees/BTreeLevelOrderTraversal.java

@@ -3,8 +3,6 @@
 import java.util.ArrayDeque;
 import java.util.Queue;
 
-import trees.InorderTraversal.Node;
-
 public class BTreeLevelOrderTraversal {
 
 static class Node{
@@ -32,6 +30,8 @@ public static void main(String[] args) {
 tree.root.left.left = new Node(25);
 tree.root.left.right = new Node(75);
 tree.root.right.right = new Node(350);
+tree.root.right.right.right = new Node(380);
+tree.root.right.right.left = new Node(320);
 
 level_traverse(tree.root);
 
@@ -40,15 +40,34 @@ public static void main(String[] args) {
 private static void level_traverse(Node root2) {
 
 if (root2==null) System.out.println("Tree is empty");
+
 Queue<Node> curr = new ArrayDeque<>();
+Node null_node = new Node(0);
+
+curr.add(root2);
+curr.add(null_node);
 
 while(!curr.isEmpty()){
-curr.add(root2);
+
+if(curr.peek().left !=null){
+curr.add(curr.peek().left);
+}
+
+if(!(curr.peek().right==null)){
+curr.add(curr.peek().right);
+}
+
+System.out.print(curr.poll().data+",");
+
+if(curr.peek()==null_node){
+System.out.println("");
+curr.poll();
+if(!curr.isEmpty()){
+curr.add(null_node);
+}
+} 
 
 }
-
-
-
 }
 
 }