0103. Binary Tree Zigzag Level Order Traversal.md

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    vector<vector<int>> zigzagLevelOrder(TreeNode* root) {
        if(!root) return {};
        queue<TreeNode*> q;
        q.push(root);
        vector<vector<int>> res;
        bool leftToRight = true;

        while(!q.empty()) {
            int size = q.size();
            vector<int> arr(size);
            for(int i = 0; i < size; i++) {
                TreeNode* node = q.front();
                q.pop();

                int pos = leftToRight ? i : size - 1 - i;
                arr[pos] = node->val;

                if(node->left) q.push(node->left);
                if(node->right) q.push(node->right);
            }
            res.push_back(arr);
            leftToRight = !leftToRight;
        }
        return res;
    }
};

---

Time Complexity: O(n)
Space Complexity: O(n)