Every day a leetcode
题目来源:102. 二叉树的层序遍历
解法1:队列
层序遍历的经典代码,C++实现。
代码:
/**
* 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) {
vector<vector<int>> ans;
// 特判
if(root == NULL) return ans;
queue<TreeNode*> q;
q.push(root);
while(!q.empty())
{
int levelSize=q.size();
ans.push_back(vector<int>());
for(int i=0;i<levelSize;i++)
{
TreeNode* node=q.front();
q.pop();
ans.back().push_back(node->val);
if(node->left) q.push(node->left);
if(node->right) q.push(node->right);
}
}
return ans;
}
};
结果: