剑指59 - 按之字形顺序打印二叉树
题目描述
请实现一个函数按照之字形打印二叉树,即第一行按照从左到右的顺序打印,第二层按照从右至左的顺序打印,第三行按照从左到右的顺序打印,其他行以此类推。
示例1
输入
{8,6,10,5,7,9,11}
返回值
[[8],[10,6],[5,7,9,11]]
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) {
if(pRoot == null) {
return new ArrayList<ArrayList<Integer> >();
}
ArrayList<ArrayList<Integer> > result = new ArrayList<ArrayList<Integer> >();
// 奇数行栈,从左向右
Stack<TreeNode> s1 = new Stack<TreeNode>();
s1.add(pRoot);
// 偶数行栈,从右向左
Stack<TreeNode> s2 = new Stack<TreeNode>();
while(!s1.isEmpty() || !s2.isEmpty()){
ArrayList<Integer> a1 = new ArrayList<Integer>();
while(!s1.isEmpty()) {
TreeNode t1 = s1.pop();
a1.add(t1.val);
if(t1.left != null)
s2.push(t1.left);
if(t1.right != null)
s2.push(t1.right);
}
if(a1.size() > 0) {
result.add(a1);
}
ArrayList<Integer> a2 = new ArrayList<Integer>();
while(!s2.isEmpty()) {
TreeNode t2 = s2.pop();
a2.add(t2.val);
if(t2.right != null)
s1.push(t2.right);
if(t2.left != null)
s1.push(t2.left);
}
if(a2.size() > 0){
result.add(a2);
}
}
return result;
}
}