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] ]
题目大意:给出一棵二叉树,按照第0层从左向右遍历,第1层从右向左遍历,第2层从左向右遍历的顺序输出层序遍历的结果。
解题思路:在普通的层序遍历基础上做一些改动即可,设置一个标记,当它是奇数时将该层的元素逆序,当它是偶数时则不作改变。
代码如下:
class Solution {
public:
/**
* @param root
* @return
*/
vector<vector<int>> zigzagLevelOrder(TreeNode *root) {
vector<vector<int>> ans;
if (root) que.push(root);
int cur = 0;
int flag = 1;
while (cur < que.size()) {
int last = que.size();
vector<int> vec;
flag += 1;
while (cur++ < last) {
TreeNode *tmp = que.front();
vec.push_back(tmp->val);
que.pop();
if (tmp->left)que.push(tmp->left);
if (tmp->right) que.push(tmp->right);
}
cur = 0;
if (flag & 1) reverse(vec.begin(),vec.end());
ans.push_back(vec);
}
return ans;
}
private:
queue<TreeNode *> que;
};