Print Level order by level
Page 1 of 1
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(" ");
}
}
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(" ");
}
}
Similar topics
» Level order traverse of a tree
» Tree Level by Level, LinkedList
» Input a string "hello word", print l:3 o:2 e:1 d:1 h:1 r:1 w:1
» print all subsets of an array whose sum equals one number
» Iterative way of in order traversal
» Tree Level by Level, LinkedList
» Input a string "hello word", print l:3 o:2 e:1 d:1 h:1 r:1 w:1
» print all subsets of an array whose sum equals one number
» Iterative way of in order traversal
Page 1 of 1
Permissions in this forum:
You cannot reply to topics in this forum
|
|