Leetcode 103. Binary Tree Zigzag Level Order Traversal (Medium) (cpp)

Leetcode 103. Binary Tree Zigzag Level Order Traversal (Medium) (cpp)

Tag: Tree, Beadth-first Search, Stack

Difficulty: Medium

/*

103. Binary Tree Zigzag Level Order Traversal (Medium)

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

*/
/**
 * 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) {
        vector<vector<int>> res;
        if (!root) return res;
        queue<TreeNode*> q;
        q.push(root);
        int level = 0;
        while (!q.empty()) {
            vector<int> lev;
            int _size = q.size();
            for (int i = 0; i < _size; i++) {
                TreeNode *temp = q.front();
                q.pop();
                lev.push_back(temp -> val);
                if (temp -> left) q.push(temp -> left);
                if (temp -> right) q.push(temp -> right);
            }
            if (level % 2) reverse(lev.begin(), lev.end());
            res.push_back(lev);
            level++;
        }
        return res;
    }
};