Print each level of a BST on it's own line

BFS.java

//Breadth First Search, traverse tree and print it out level-by-level

public class TreeNode{
 public int data;
 public int level;
 public TreeNode left;
 public TreeNode right;
 public TreeNode(int d, int l){
  this.data = d;
  this.level = l;
  this.left = null;
  this right = null;
 }
}

public class BinaryTree{
 public TreeNode root;
 public BinaryTree(){
  this.root = null;
 }
 
 public void setLevels(TreeNode node, int l){
  if (node != null){
   node.level = l;
   setLevels(node.left, level + 1);
   setLevels(node.right, level + 1);
  }
  
 }
 
 public void printEachTreeLevel(TreeNode root){
  Queue<TreeNode> treeQueue = new LinkedList<TreeNode>();
  if (root == null){
   return;
  }
  //set levels, just in case
  setLevels(root, 0);
  //Start Breadth first traversal of tree
  treeQueue.clear();
  treeQueue.add(root);
  while (!(treeQueue.size() == 0)){
   TreeNode node = treeQueue.remove();
   System.out.print(node.data + " ");
   //If we are at the end of a level, start a new line
   if (node.level != treeQueue.peek().level){
    System.out.println();
   }
   if (node.left != null){
    treeQueue.add(node.left);
   }
   if (node.right != null){
    treeQueue.add(node.right);
   }
  }
 }
  
}