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;
vector<int> vec;
queue<TreeNode*> q;
TreeNode *temp=NULL;
if(root==NULL) return res;
q.push(root);
q.push(NULL);
while(!q.empty()) {
temp = q.front();
q.pop();
if(temp!=NULL) {
vec.push_back(temp->val);
if(temp->left!=NULL)
q.push(temp->left);
if(temp->right!=NULL)
q.push(temp->right);
} else {
q.push(NULL);
res.push_back(vec);
vec.clear();
if(q.front()==NULL) break;
}
}
for(int i=1; i<res.size(); i+=2) {
reverse(res[i].begin(), res[i].end());
}
return res;
}
};