LeetCode 103. Binary Tree Zigzag Level Order Traversal

题目：

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]
]

---

直接level-order traversal并根据层数把数字倒过来。

Runtime: 4 ms, faster than 86.26% of C++ online submissions for Binary Tree Zigzag Level Order Traversal.

Memory Usage: 13.6 MB, less than 74.42% of C++ online submissions for Binary Tree Zigzag Level Order Traversal.

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<vector<int>> zigzagLevelOrder(TreeNode* root) {
        if (!root) {
            return vector<vector<int>>();
        }
        vector<vector<int>> result;
        queue<TreeNode*> q;
        q.push(root);
        bool reverse_order = false;
        while (q.size() != 0) {
            vector<int> level;
            int size = q.size();
            for (int i = 0; i < size; i++) {
                TreeNode* front = q.front();
                level.push_back(front->val);
                q.pop();
                if (front->left)
                    q.push(front->left);
                if (front->right)
                    q.push(front->right);
            }
            if (reverse_order)
                reverse(level.begin(), level.end());
            result.push_back(level);
            reverse_order = !reverse_order;
        }
        return result;
    }
};

2020.10.21 Java

用一个boolean标记当前是否应该reverse，踩了几个小坑：切换reverse刚开始写到for里面去了、因为要根据reverse的值来判断加在前面还是后面所以定义temp的时候要用LinkedList。

Runtime: 1 ms, faster than 74.78% of Java online submissions for Binary Tree Zigzag Level Order Traversal.

Memory Usage: 39.2 MB, less than 34.45% of Java online submissions for 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>> result = new LinkedList<>();
        if (root == null) {
            return result;
        }
        Queue<TreeNode> queue = new ArrayDeque<>();
        boolean reverse = false;
        queue.add(root);
        while (!queue.isEmpty()) {
            int size = queue.size();
            LinkedList<Integer> temp = new LinkedList<>();
            for (int i = 0; i < size; i++) {
                TreeNode node = queue.poll();
                if (reverse) {
                    temp.addFirst(node.val);
                } else {
                    temp.addLast(node.val);
                }
                if (node.left != null) {
                    queue.add(node.left);
                }
                if (node.right != null) {
                    queue.add(node.right);
                }
            }
            reverse = !reverse;
            result.add(temp);
        }
        return result;
    }
}