1、题目
https://leetcode-cn.com/problems/binary-tree-level-order-traversal/
2、题意
题解1:bfs
class Solution {
public:
vector<vector<int>> levelOrder(TreeNode* root) {
vector<vector<int>> res;
queue<TreeNode*> q;
if(root) q.push(root);
while(q.size())
{
int len = q.size();
vector<int> lev;
for(int i=0;i<len;i++)
{
auto t = q.front();
q.pop();
lev.push_back(t->val);
if(t->left) q.push(t->left);
if(t->right) q.push(t->right);
}
res.push_back(lev);
}
return res;
}
};