微信公众号:CurryCoder的程序人生
业精于勤,荒于嬉;行成于思,毁于随
1.题目描述
2.题解
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*> que;
if(root != nullptr) que.push(root);
vector<vector<int>> result;
while(!que.empty()){
int size = que.size();
vetor<int> vec;
for(int i = 0; i < size; i++){
TreeNode* node = que.front();
que.pop();
vec.push_back(node->val);
if(node->left) que.push(node->left);
if(node->right) que.push(node->right);
}
result.push_back(vec);
}
return result;
}
};
觉得不错,请一键三连吧↓↓↓