Binary tree hierarchy traversal java

Sequence traversal definition

1. Visit the root node
2. When visiting layer 1, store the nodes of layer 1+1 in the queue in order
3. Enter the next layer and visit all nodes of this layer
4. Repeat the above steps until all layers are Traversed

void levelOrder(BinaryTrēeNode root){
    
    
    BinaryTreeNode temp;
    LLQueue q = new LLQueue();
    if(root == null){
    
    
      return;
    }
    //根节点入队
    q.enQueue(root);
    while(!q.isEmpty()){
    
    
       temp = q.deQueue();
       //处理当前节点
       System.out.println(temp.getData());
       if(temp.getLeft() != null){
    
    
         q.enQueue(temp.getLeft());
       }
       if(temp.getRight()){
    
    
         q.enQueue(temp.getRight());
       }
    }
    q.deleteQueue();
}