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] ]
Subscribe to see which companies asked this question
/**
* 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 == NULL) return res;
queue<TreeNode*>q;
q.push(root);
int i=0;
while(!q.empty()){
vector<int>p;
i++;
int _size = q.size();
for(int i = 0; i < _size; i++){
TreeNode *temp = q.front();
q.pop();
p.push_back(temp->val);
if(temp->left)
q.push(temp->left);
if(temp->right)
q.push(temp->right);
}
if(i%2==0)
{
reverse(p.begin(),p.end());
}
res.push_back(p);
}
return res;
}
};