binary-tree-zigzag-level-order-traversal Java code

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]
]
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.List;
import java.util.ArrayList;
import java.util.Stack;
public class Solution {
    public ArrayList<ArrayList<Integer>> zigzagLevelOrder(TreeNode root) {
        return test(root);
    }
    public ArrayList<ArrayList<Integer>> test(TreeNode root){
        ArrayList<ArrayList<Integer>> lists = new ArrayList<>();
        if(root==null){
            return lists;
        }
        Stack<TreeNode> stack1=new Stack<TreeNode>();
        Stack<TreeNode> stack2=new Stack<TreeNode>();
        stack1.push(root);
        while(!stack1.isEmpty()||!stack2.isEmpty()){
            ArrayList<Integer> list=new ArrayList<>();
            while(!stack1.isEmpty()){
                TreeNode node=stack1.pop();
                if(node.left!=null)
                    stack2.push(node.left);
                if(node.right!=null)
                    stack2.push(node.right);
                list.add(node.val);
            }
            lists.add(list);
            list=new ArrayList<>();
            while(!stack2.isEmpty()){
                TreeNode node=stack2.pop();
                if(node.right!=null)
                    stack1.push(node.right);
                if(node.left!=null)
                    stack1.push(node.left);
                list.add(node.val);
            }
            if(!list.isEmpty()){
                lists.add(list);
            }
        }
        return lists;
    }
}