Q:给定一个二叉树,按照之字形打印
A:与从左往右输出类似,只不过这里加一个标记奇偶行的判断即可 需要从右往左打印的行 进行反转即可
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) {
ArrayList<ArrayList<Integer>> res = new ArrayList<>();
if(pRoot==null){
return res;
}
int count = 0;
ArrayDeque<TreeNode> queue = new ArrayDeque<>();
queue.add(pRoot);
while(!queue.isEmpty()){
int size = queue.size();
ArrayList<Integer> list = new ArrayList<>();
for(int i=0;i<size;i++){
TreeNode node = queue.poll();
list.add(node.val);
if(node.left!=null){
queue.add(node.left);
}
if(node.right!=null){
queue.add(node.right);
}
}
if(count % 2 != 0){
Collections.reverse(list);
}
count ++;
res.add(list);
}
return res;
}
}