LeetCode 103. 【层序遍历】z字形遍历二叉树
原题链接
简单
作者:
大明湖的鱼
,
2021-01-16 20:49:36
,
所有人可见
,
阅读 371
/**
* 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) {
if(root == NULL) return vector<vector<int>>{};
vector<vector<int>> res;
queue<TreeNode*> q;
int depth = 0;
q.push(root);
while(!q.empty()){
vector<int> tmp;
TreeNode* node;
int len = q.size();
for(int i = 0 ;i<len;i++){
node = q.front();
q.pop();
tmp.emplace_back(node->val);
if(node->left) q.push(node->left);
if(node->right) q.push(node->right);
}
if(depth%2) reverse(tmp.begin(),tmp.end());
depth++;
res.emplace_back(tmp);
}
return res;
}
};
20220114剑指offer二刷