题目描述
题解
层序遍历,记录行数来判断是否需要反转数组。
/**
* Definition for a binary tree node.
* 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>> result;
if(root == nullptr) return result;
queue<TreeNode*> q;
q.push(root);
int flag = 0;
while(!q.empty()){
vector<int> path;
int n = q.size();
for(int i = 0; i < n; i++){
TreeNode* node = q.front();
path.push_back(node->val);
q.pop();
if(node->left) q.push(node->left);
if(node->right) q.push(node->right);
}
if(flag % 2 == 0){
result.push_back(path);
}
else{
reverse(path.begin(),path.end());
result.push_back(path);
}
flag++;
}
return result;
}
};