【Leetcode】103. Binary Tree Zigzag Level Order Traversal

题目地址：

https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/

二叉树层序遍历，但要求在第偶数层逆序遍历。用一个boolean变量标记一下即可。

import java.util.*;

public class Solution {
    public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
        List<List<Integer>> res = new ArrayList<>();
        
        if (root == null) {
            return res;
        }
        
        Queue<TreeNode> queue = new ArrayDeque<>();
        queue.offer(root);
        boolean reverse = false;
        while (!queue.isEmpty()) {
            int len = queue.size();
            // 用LinkedList的话在表头添加效率更高
            List<Integer> row = new LinkedList<>();
            for (int i = 0; i < len; i++) {
                TreeNode x = queue.poll();
                if (!reverse) {
                    row.add(x.val);
                } else {
                    row.add(0, x.val);
                }
                if (x.left != null) {
                    queue.offer(x.left);
                }
                if (x.right != null) {
                    queue.offer(x.right);
                }
            }
            reverse = !reverse;
            res.add(new ArrayList<>(row));
        }
        
        return res;
    }
}

class TreeNode {
    int val;
    TreeNode left;
    TreeNode right;
    TreeNode(int x) { val = x; }
}