面试冲刺算法系列-51

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

设立两个堆，分别存放一个奇数层和偶数层

import java.util.ArrayList;
import java.util.Stack;
/*
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 pRoot) {
         Stack<TreeNode> s1 = new Stack<TreeNode>();
         Stack<TreeNode> s2 = new Stack<TreeNode>();
         ArrayList<ArrayList<Integer>> mylist = new ArrayList<>();
         if(pRoot == null)return mylist;
         s1.push(pRoot);
         int i = 1;
        while(!s1.isEmpty() || !s2.isEmpty()){
        if(i%2 == 1){
            ArrayList<Integer> list = new ArrayList<Integer>();
            i++;
         while(!s1.isEmpty()){
             TreeNode temp = s1.pop();
             if(temp.left != null)s2.push(temp.left);
             if(temp.right != null)s2.push(temp.right);
             list.add(temp.val);
         }
            mylist.add(list);
      }
        else if(i%2 == 0){
            ArrayList<Integer> list = new ArrayList<Integer>();
            i++;
            while(!s2.isEmpty()){
                TreeNode temp = s2.pop();
                if(temp.right != null)s1.push(temp.right);
                if(temp.left != null)s1.push(temp.left);
                list.add(temp.val);
            }
            mylist.add(list);
        }
        }
             
         return mylist;
    }

}