트리에서의 BFS (Java)

BFS: 너비 우선 탐색 

    public void bfsTree(TreeNode root){
        if(root==null)
            return;
        Queue<TreeNode> queue = new LinkedList<>();

        queue.add(root);
        while(!queue.isEmpty()){
        	int n = queue.size();
            for (int i = 0; i < n; i++) {
                TreeNode nextNode = queue.poll();
                // Do Working
                
                if(nextNode.left!=null)
                    queue.add(nextNode.left);
                if(nextNode.right!=null)
                    queue.add(nextNode.right);
            }
        }
    }