[数据结构][Tree]Search Binary Tree For Level Order

public class BinaryTreeNode
{
    public Object data;
    
    public BinaryTreeNode leftPointer;
    
    public BinaryTreeNode rightPointer;
    
    public BinaryTreeNode(Object data)
    {
        this.data = data;
    }
    
}

public class Solution
{
    public void levelOrder(BinaryTreeNode node)
    {
         Queue<BinaryTreeNode> queue = new LinkedList<BinaryTreeNode>();
         
         queue.add(node);
         
         while(queue.isEmpty() == false)
         {
             BinaryTreeNode tempNode = queue.remove();
             
             visit(tempNode);
             
             if(tempNode.leftPointer != null)
             {
                 queue.add(tempNode.leftPointer);
             }
             if(tempNode.rightPointer != null)
             {
                 queue.add(tempNode.rightPointer);
             }
         }
    }
    
    public void visit(BinaryTreeNode node)
    {
        System.out.println(node.data);
    }
    
}