/**
* 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>> levelOrder(TreeNode* root) {
queue<TreeNode *> qu;
vector<vector<int>> ans;
if(!root){
return ans;
}
qu.push(root);
while(!qu.empty()){
vector<int> v;
int size = qu.size();
for(int i=0; i<size; i++){
TreeNode *tmp = qu.front();
qu.pop();
v.push_back(tmp->val);
if(tmp->left)
qu.push(tmp->left);
if(tmp->right)
qu.push(tmp->right);
}
ans.push_back(v);
}
return ans;
}
};
// 题目来源:https://leetcode-cn.com/problems/binary-tree-level-order-traversal/
层序遍历模板(C++)
最新推荐文章于 2023-04-18 21:14:51 发布