分析:我们利用两个栈,一个栈从左到右保存元素,一个栈从右到左保存元素。然后访问栈顶元素,弹栈,直到两个栈同时为空。
import java.util.ArrayList;
/*
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
import java.util.*;
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>> list=new ArrayList<ArrayList<Integer>>();
ArrayList<Integer> tmp=new ArrayList<Integer>();
if(pRoot == null){
return list;
}
tmp.add(pRoot.val);
list.add(tmp);
tmp = null;
s1.push(pRoot);
while(s1.isEmpty() || s2.isEmpty()){
if(s1.isEmpty() && s2.isEmpty()){
//都为空
break;
}
ArrayList<Integer> tmpList=new ArrayList<Integer>();
if(s2.isEmpty()){
while(!s1.isEmpty()){
if(s1.peek().right != null){
tmpList.add(s1.peek().right.val);
s2.push(s1.peek().right);
}
if(s1.peek().left != null){
tmpList.add(s1.peek().left.val);
s2.push(s1.peek().left);
}
//弹栈
s1.pop();
}
}else{
while(!s2.isEmpty()){
if(s2.peek().left != null){
tmpList.add(s2.peek().left.val);
s1.push(s2.peek().left);
}
if(s2.peek().right != null){
tmpList.add(s2.peek().right.val);
s1.push(s2.peek().right);
}
//弹栈
s2.pop();
}
}
if(tmpList.size() > 0){
list.add(tmpList);
}
}
return list;
}
}