Can someone help me print my BST in level order.
Heres what i got so far...
Queue<BinaryNode<Type>> f=null;
while(node.element!=null){
System.out.println(node.element);
if(node.left!=null){
f.offer(node.left);
}
if(node.right!=null){
f.offer(node.right);
}
if(!f.isEmpty()){
node=f.remove();
}
else{
node.element=null;
}
}