给定一个二叉树,返回其节点值的锯齿形层序遍历。(即先从左往右,再从右往左进行下一层遍历,以此类推,层与层之间交替进行)。
例如:
给定二叉树 [3,9,20,null,null,15,7],
3
/
9 20
/
15 7
返回锯齿形层序遍历如下:
[
[3],
[20,9],
[15,7]
]
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/binary-tree-zigzag-level-order-traversal
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
/**
* 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>> res = new LinkedList<List<Integer>>();
//base case
if(root == null){
return res;
}
//队列
Queue<TreeNode> q = new LinkedList<TreeNode>();
q.offer(root);
boolean isLeft = true;
while(!q.isEmpty()){
int size = q.size();
//双向队列
Deque<Integer> q1 = new LinkedList<Integer>();
for(int i = 0;i < size;i++){
TreeNode node = q.poll();
if(isLeft){
q1.offerLast(node.val);
}else{
q1.offerFirst(node.val);
}
if(node.left!=null){
q.offer(node.left);
}
if(node.right!=null){
q.offer(node.right);
}
}
res.add(new LinkedList<>(q1));
isLeft = !isLeft;
}
return res;
}
}