binary-tree-level-order-traversal Java code

Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).
For example:
Given binary tree{3,9,20,#,#,15,7},
3
/ \
9 20
/ \
15 7
return its level order traversal as:
[
[3],
[9,20],
[15,7]
]
confused what”{1,#,2,3}”means? > read more on how binary tree is serialized on OJ.
OJ’s Binary Tree Serialization:
The serialization of a binary tree follows a level order traversal, where ‘#’ signifies a path terminator where no node exists below.
Here’s an example:
1
/ \
2 3
/
4
\
5
The above binary tree is serialized as”{1,2,3,#,#,4,#,#,5}”.

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Collections;
public class Solution {
    public ArrayList<ArrayList<Integer>> levelOrder(TreeNode root) {
     ArrayList<ArrayList<Integer>>list=new ArrayList<>();
        if(root==null){
            return list;
        }
        z(list,root);
        return list;
    }
    public void z(ArrayList<ArrayList<Integer>>lists,TreeNode root){
        ArrayDeque<TreeNode> que=new ArrayDeque<>();
        que.add(root);
        boolean f=true;
        while (!que.isEmpty()){
            ArrayList<Integer>list=new ArrayList<>();
            int i=que.size();
            for(int j=0;j<i;j++){
               TreeNode a=que.pop();
                list.add(a.val);
                if(a.left!=null){
                    que.add(a.left);
                }
                if(a.right!=null){
                    que.add(a.right);
                }
            }
                lists.add(list);
            }
        }
}