请实现一个函数按照之字形打印二叉树,即第一行按照从左到右的顺序打印,第二层按照从右至左的顺序打印,第三行按照从左到右的顺序打印,其他行以此类推。
import java.util.ArrayList;
import java.util.Stack;
public class T_59_ZhiPrint {
public ArrayList<ArrayList<Integer>> Print(TreeNode pRoot) {
ArrayList<ArrayList<Integer>> res = new ArrayList<>();
Stack<TreeNode> s1 = new Stack<>();
Stack<TreeNode> s2 = new Stack<>();
int flag = 1;
if (pRoot == null) {
return res;
}
s1.push(pRoot);
ArrayList<Integer> temp = new ArrayList<>();
while (!s1.isEmpty() || !s2.isEmpty()) {
if (flag % 2 != 0) {
while (!s1.isEmpty()) {
TreeNode node = s1.pop();
temp.add(node.val);
if (node.left != null) {
s2.push(node.left);
}
if (node.right != null) {
s2.push(node.right);
}
}
} else {
while (!s2.isEmpty()) {
TreeNode node = s2.pop();
temp.add(node.val);
if (node.right != null) {
s1.push(node.right);
}
if (node.left != null) {
s1.push(node.left);
}
}
}
res.add(new ArrayList<>(temp));
temp.clear();
flag++;
}
return res;
}
}