http://www.manongjc.com/detail/10-bnbcadnmhcmqdya.html
import java.util.*;
/*
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) {
// 开始需要初始化 两个栈先进先出的 层数1 入栈根节点
Stack<TreeNode> s1 = new Stack<TreeNode>();
Stack<TreeNode> s2 = new Stack<TreeNode>();
int layer = 1;
s1.push(pRoot);
ArrayList<ArrayList<Integer>> list = new ArrayList<ArrayList<Integer>>();
// while循环 任意一个栈不是空就是没打印完毕
while(!s1.isEmpty()||!s2.isEmpty()){
// 在奇数层则打印的是先左节点后右节点
if(layer%2!=0){
ArrayList<Integer> temp = new ArrayList<>();
while(!s1.empty()){
TreeNode node = s1.pop();
if(node!=null){
temp.add(node.val);
s2.push(node.left);
s2.push(node.right);
}
}
if(!temp.isEmpty()){
list.add(temp);
layer++;
}
}else{
// 偶数层打印的是先右节点后左节点
ArrayList<Integer> temp = new ArrayList<>();
while(!s2.empty()){
TreeNode node = s2.pop();
if(node!=null){
temp.add(node.val);
s1.push(node.right);
s1.push(node.left);
}
}
if(!temp.isEmpty()){
list.add(temp);
layer++;
}
}
}
return list;
}
}