【剑指offer】按之字形顺序打印二叉树

https://www.nowcoder.com/practice/91b69814117f4e8097390d107d2efbe0?tpId=13&tqId=11212&tPage=3&rp=3&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking

使用两个栈交替存放下一行的结点，结点的顺序也要改变。

import java.util.ArrayList;
import java.util.Stack;

class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;
    public TreeNode(int val) {
        this.val = val;
    }
}

public class zPrint {
    public ArrayList<ArrayList<Integer> > Print(TreeNode pRoot) {
        ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();
        if(pRoot == null) return result;
        Stack<TreeNode> stack1 = new Stack<>();
        Stack<TreeNode> stack2 = new Stack<>();
        stack1.add(pRoot);
        while(!stack1.isEmpty() || !stack2.isEmpty()){
            
            if(!stack1.isEmpty()){
                ArrayList<Integer> items = new ArrayList<>();
                while(!stack1.isEmpty()){
                    TreeNode node = stack1.pop();
                    items.add(node.val);
                    if(node.left != null) stack2.add(node.left);
                    if(node.right != null) stack2.add(node.right);
                }
                result.add(items);
            }else{
                ArrayList<Integer> items = new ArrayList<>();
                while(!stack2.isEmpty()){
                    TreeNode node = stack2.pop();
                    items.add(node.val);
                    if(node.right != null) stack1.add(node.right);
                    if(node.left != null) stack1.add(node.left);
                }
                result.add(items);
            }  
        }
        return result;
    }
}