- 二叉树的锯齿形层序遍历
给你二叉树的根节点 root ,返回其节点值的 锯齿形层序遍历 。(即先从左往右,再从右往左进行下一层遍历,以此类推,层与层之间交替进行)。
示例 1:
输入:root = [3,9,20,null,null,15,7]
输出:[[3],[20,9],[15,7]]
示例 2:
输入:root = [1]
输出:[[1]]
示例 3:
输入:root = []
输出:[]
**解析:**双端队列Deque的使用
代码:
/**
* 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>>();
if(root==null) return res;
Queue<TreeNode> q=new LinkedList<TreeNode>();
boolean isOrderLeft= true;
q.offer(root);
while(!q.isEmpty()){
int size=q.size();
Deque<Integer> deque=new LinkedList<>();
for(int i=0;i<size;i++){
TreeNode node=q.poll();
if(isOrderLeft){
deque.addLast(node.val);
}else{
deque.addFirst(node.val);
}
if(node.left!=null){
q.offer(node.left);
}
if(node.right!=null){
q.offer(node.right);
}
}
res.add(new LinkedList<Integer>(deque));
isOrderLeft=!isOrderLeft;
}
return res;
}
}