给你二叉树的根节点 root ,返回其节点值的 锯齿形层序遍历 。(即先从左往右,再从右往左进行下一层遍历,以此类推,层与层之间交替进行)。
#include <iostream>
#include <vector>
#include <queue>
#include <deque>
using namespace std;
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) {
vector<vector<int>> ans;
if (!root) {
return ans;
}
queue<TreeNode*> que;
que.push(root);
bool isLeftToRight = true;
while(!que.empty()) {
deque<int> layerAns;
int size = que.size();
for (int i = 0; i < size; ++i) {
TreeNode* front = que.front();
que.pop();
if (isLeftToRight) {
layerAns.push_back(front->val);
} else {
layerAns.push_front(front->val);
}
if (front->left) {
que.push(front->left);
}
if (front->right) {
que.push(front->right);
}
}
isLeftToRight = !isLeftToRight;
ans.emplace_back(vector<int>(layerAns.begin(), layerAns.end()));
}
return ans;
}
};