剑指offer_14 按之字形顺序打印二叉树

一、题目描述

二、解题思路

三、代码实现

/*
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) {
        
        ArrayList<ArrayList<Integer>> alist = new ArrayList<>();
        if(pRoot == null){
            return alist;
        }
        Stack<TreeNode> stack1 = new Stack<>();
        Stack<TreeNode> stack2 = new Stack<>();
        stack1.push(pRoot);
        while(!stack1.empty() || !stack2.empty()){
            ArrayList<Integer> list = new ArrayList<>();
            if(!stack1.empty()){
                while(!stack1.empty()){
	                TreeNode temp = stack1.pop();
	                list.add(temp.val);
	                if(temp.left != null){
	                    stack2.push(temp.left);
	                }
	                if(temp.right != null){
	                    stack2.push(temp.right);
	                }
            	}
                alist.add(list);
            }
            else{
                while(!stack2.empty()){
	                TreeNode temp = stack2.pop();
	                list.add(temp.val);
	                if(temp.right != null){
	                    stack1.push(temp.right);
	                }
	                if(temp.left != null){
	                    stack1.push(temp.left);
	                }
            	}
            	alist.add(list);
            }
        }
        return alist;
    }
}
--------------------- 
作者：justlikeu777 
来源：CSDN 
原文：https://blog.csdn.net/justlikeu777/article/details/87902928