LeetCode 103 Binary Tree Zigzag Level Order Traversal (BFS)

Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between).

For example:
Given binary tree [3,9,20,null,null,15,7],

    3
   / \
  9  20
    /  \
   15   7

 

return its zigzag level order traversal as:

[
  [3],
  [20,9],
  [15,7]
]

题目链接：https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/

题目分析：裸BFS，记录每层的个数即可

时间1ms，击败96.19%

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
        List<List<Integer>> ans = new LinkedList<>();
        if (root == null) {
            return ans;
        }
        Queue<TreeNode> q = new LinkedList<>();
        q.offer(root);
        int order = 1;
        while (!q.isEmpty()) {
            LinkedList<Integer> cur = new LinkedList<>();
            int sz = q.size();
            while (sz > 0) {
                TreeNode tn = q.poll();
                sz--;
                if (order == 1) {
                    cur.add(tn.val);
                } else {
                    cur.addFirst(tn.val);
                }
                if (tn.left != null) {
                    q.offer(tn.left);
                }
                if (tn.right != null) {
                    q.offer(tn.right);
                }
            }
            ans.add(cur);
            order = -order;
        }
        return ans;
    }
}