题目描述:请实现一个函数按照之字形打印二叉树,即第一行按照从左到右的顺序打印,第二层按照从右至左的顺序打印,第三行按照从左到右的顺序打印,其他行以此类推。
题解:
import java.util.ArrayList;import java.util.Queue;
import java.util.LinkedList;
import java.util.Collections;
/*
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) {
Queue<TreeNode> queue = new LinkedList<>();
ArrayList<ArrayList<Integer>> list = new ArrayList<>();
queue.add(pRoot);
boolean reverse = false;
while(!queue.isEmpty()){
int cnt = queue.size();
ArrayList<Integer> l = new ArrayList<>();
while(cnt-->0){
TreeNode t = queue.poll();
if(t==null)
continue;
l.add(t.val);
queue.add(t.left);
queue.add(t.right);
}
if(reverse)
Collections.reverse(l);
reverse=!reverse;
if(l.size()!=0)
list.add(l);
}
return list;
}
}