题目描述
请实现一个函数按照之字形打印二叉树,即第一行按照从左到右的顺序打印,第二层按照从右至左的顺序打印,第三行按照从左到右的顺序打印,其他行以此类推。
题解
设置两个栈,一个栈按照从右向左的顺序保存奇数行节点,另一个栈按照从左向右的顺序保存偶数行节点,逐层遍历即可。
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) {
ArrayList<ArrayList<Integer>> lists = new ArrayList<>();
Stack<TreeNode> s1 = new Stack<TreeNode>();
Stack<TreeNode> s2 = new Stack<TreeNode>();
int layer = 1;
s1.push(pRoot);
while (!s1.isEmpty() || !s2.isEmpty()){
if (layer % 2 != 0){
ArrayList<Integer> list = new ArrayList<>();
while (!s1.empty()){
TreeNode node = s1.pop();
if (node != null){
list.add(node.val);
s2.push(node.left);
s2.push(node.right);
}
}
if (!list.isEmpty()){
lists.add(list);
layer++;
}
}else {
ArrayList<Integer> list = new ArrayList<>();
while (!s2.empty()){
TreeNode node = s2.pop();
if (node != null){
list.add(node.val);
s1.push(node.right);
s1.push(node.left);
}
}
if (!list.isEmpty()){
lists.add(list);
layer++;
}
}
}
return lists;
}
}