Binary Tree Level order Traversal (Each level on new line)

Test.java

import java.util.Queue;
import java.util.LinkedList;

class Node{
    int data;
    Node left, right;

    Node(int data){
        this.data = data;
        this.left = null;
        this.right = null;
    }
}

class BinaryTree{
    Node root;

    void printLevelOrder(){
        Queue<Node> queue = new LinkedList<Node>();
        queue.add(root);

        int nodeCount;

        while(true){

            /* Get the number of nodes in this level */
            nodeCount = queue.size();

            if(nodeCount == 0){
                break;
            }

            /* Print all the nodes on this level */
            while(nodeCount > 0){
                Node curr = queue.poll();
                System.out.print(curr.data + " ");
                nodeCount -= 1;

                if(curr.left != null){
                    queue.add(curr.left);
                }
                if(curr.right != null){
                    queue.add(curr.right);
                }
            }
            /* Print the new line */
            System.out.println();
        }
    }
}


public class Test{
    public static void main(String[] args){
        BinaryTree tree = new BinaryTree();
        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.left = new Node(6);
        tree.root.right.right = new Node(7);
        System.out.println("Level order traversal of the tree:");
        tree.printLevelOrder();
        System.out.println();
    }
}