知识点:
标准的BFS,或者说是标准的层次遍历:
1.注意对于每层的元素个数,要每次循环改编q内的元素个数
队列存的个数应该用定义变量去定义,而不能直接写成如下形式:
for(int i = 0; i< q.size(); i++)
其他就没啥需要注意得了:
/**
* 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>> levelOrder(TreeNode* root) {
vector<vector<int>> ans;
if(!root) return ans;
queue<TreeNode*> q;
q.push(root);
while(!q.empty())
{
vector<int> inside;
int l = q.size();
for(int i = 0; i< l; i++)
{
TreeNode* tr = q.front();
q.pop();
inside.push_back(tr -> val);
if(tr -> left) q.push(tr -> left);
if(tr -> right) q.push(tr -> right);
}
ans.push_back(inside);
}
return ans;
}
};