剑指offer 之字形打印二叉树 java实现

代码如下

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<>();//存放奇数层节点，从第一层开始计算
        Stack<TreeNode> s2 = new Stack<>();//存放偶数层节点
        ArrayList< ArrayList<Integer> > ans = new ArrayList<>();
        if(pRoot == null)
            return ans;
        s1.push(pRoot);
        while( !s1.empty() || !s2.empty() ){
            ArrayList<Integer> temp = new ArrayList<>();//临时结果
            if(s2.empty())
                while(!s1.empty()){
                    //奇数层的子节点弹出顺序是从右到左，则存放顺序是从左到右
                    TreeNode top = s1.pop();
                    temp.add(top.val);
                    if(top.left != null)
                        s2.push(top.left);
                    if(top.right != null)
                        s2.push(top.right);
                }
            else
                while(!s2.empty()){
                    //与奇数层正好相反
                    TreeNode top = s2.pop();
                    temp.add(top.val);
                    if(top.right != null)
                        s1.push(top.right);
                    if(top.left != null)
                        s1.push(top.left);
                }
            ans.add(temp);
        }
        return ans;
    }
}