Binary Tree Zigzag Level Order Traversal (LeetCode)

Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between).

For example:
Given binary tree {3,9,20,#,#,15,7},

    3
   / \
  9  20
    /  \
   15   7

return its zigzag level order traversal as:

[
  [3],
  [20,9],
  [15,7]
]

Solution 1 : bfs

public ArrayList<ArrayList<Integer>> zigzagLevelOrder(TreeNode root) {
        ArrayList<ArrayList<Integer>> list = new ArrayList<ArrayList<Integer>>();
        if(root==null)
            return list;
        Queue<TreeNode> queue = new LinkedList<TreeNode>();
        ArrayList<Integer> sub = new ArrayList<Integer>();
        queue.add(root);
        boolean leftToRight=true;
        int current = 1, next = 0;
        while(!queue.isEmpty()){
            TreeNode node = queue.remove();
            if(node.left!=null){
                queue.add(node.left);
                next++;
            }
            if(node.right!=null){
                queue.add(node.right);
                next++;
            }
            if(leftToRight)
                sub.add(node.val);
            else
                sub.add(0,node.val);
            current--;
            if(current==0){
                list.add(new ArrayList<Integer>(sub));
                sub.clear();
                current=next;
                next=0;
                leftToRight=!leftToRight;
            }
        }
        return list;
    }

Solution 2: dfs

public ArrayList<ArrayList<Integer>> zigzagLevelOrder(TreeNode root) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        ArrayList<ArrayList<Integer>> list = new ArrayList<ArrayList<Integer>>();
        zigzagHelper(root, 0, list);
        return list;
    }
    
    public void zigzagHelper(TreeNode root, int height, ArrayList<ArrayList<Integer>> list){
        if(root==null)
            return;
        if(height == list.size()){
            ArrayList<Integer> sub = new ArrayList<Integer>();
            sub.add(root.val);
            list.add(sub);
        }
        else{
            ArrayList<Integer> sub = list.get(height);
            if(height%2==0)
                sub.add(root.val);
            else
                sub.add(0,root.val);
        }
        zigzagHelper(root.left,height+1,list);
        zigzagHelper(root.right,height+1,list);
        
    }