按之字形顺序打印二叉树

Description：请实现一个函数按照之字形打印二叉树，即第一行按照从左到右的顺序打印，第二层按照从右至左的顺序打印，第三行按照从左到右的顺序打印，其他行以此类推。

import java.util.ArrayList;
import java.util.LinkedList;
/*
public class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;

    public TreeNode(int val) {
        this.val = val;

    }

}
*/
public class Solution {
    public ArrayList<ArrayList<Integer> > Print(TreeNode root) {
        ArrayList<ArrayList<Integer>> list = new ArrayList<>();
        if (root == null) 
            return list;
        LinkedList<TreeNode> q = new LinkedList<>();
        q.offer(root);
        
        int index = 1;
        while (!q.isEmpty()) {
            int n = q.size();
            ArrayList<Integer> tmpList = new ArrayList<>();
            for (int i = 0; i < n; i++) {
                if (q.peek().left != null) 
                    q.offer(q.peek().left);
                if (q.peek().right != null) 
                    q.offer(q.peek().right);
                if (index % 2 == 1)
                    tmpList.add(q.poll().val);
                else 
                    tmpList.add(0, q.poll().val);
            }
            if (index == 1)
                index = 2;
            else 
                index = 1;
            list.add(tmpList);
        }
        return list;
    }

}