难度中等624
给你二叉树的根节点 root
,返回其节点值的 锯齿形层序遍历 。(即先从左往右,再从右往左进行下一层遍历,以此类推,层与层之间交替进行)。
示例 1:
输入:root = [3,9,20,null,null,15,7] 输出:[[3],[20,9],[15,7]]
示例 2:
输入:root = [1] 输出:[[1]]
示例 3:
输入:root = [] 输出:[]
提示:
- 树中节点数目在范围
[0, 2000]
内 -100 <= Node.val <= 100
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
List<List<Integer>> ans = new ArrayList<List<Integer>>();
if (root == null) {
return ans;
}
Queue<TreeNode> q = new LinkedList<TreeNode>();
//正反向标志
boolean isForward = true;
q.offer(root);
while (!q.isEmpty()) {
int size = q.size();
List<Integer> subList = new ArrayList<Integer>();
for (int i = 0 ; i < size ; i++) {
TreeNode treeNode = q.poll();
subList.add(treeNode.val);
if (treeNode.left != null) {
q.offer(treeNode.left);
}
if (treeNode.right != null) {
q.offer(treeNode.right);
}
}
//根据标志来确认当前层遍历的方向
if (!isForward) {
Collections.reverse(subList);//翻转
}
ans.add(subList);
//方向反转
isForward = !isForward;
}
return ans;
}
}