Print Level order by level

public void Level(TreeNode root){
Queue<TreeNode> q1=new Queue<TreeNode>();
Queue<TreeNode> q2=new Queue<TreeNode>();
q1.enqueue(root);
while(!q1.isEmpty()||(!q2.isEmpty())){
while(!q1.isEmpty()){
TreeNode temp=q1.dequeue();
System.out.print(temp.value);
if(temp.left)
q2.enqueue(temp.left);
if(temp.right)
q2.enqueue(temp.right);
}
System.out.println("");
while(!q2.isEmpty()){
TreeNode temp1=q2.dequeue();
System.out.print(temp1.value);
if(temp1.left)
q1.enqueue(temp.left);
if(temp2.right)
q2.enqueue(temp.right);
}
System.out.println(" ");

}
}