题目
https://leetcode-cn.com/problems/binary-tree-level-order-traversal/
思路
队列实现BFS;使用队列来存放每层的节点,从第一层开始检索,如果有孩子就压入。队列:先进先出,遍历队列的front,即可实现BFS
AC代码
/**
* 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>> res;
queue<TreeNode *>q;
if(root == NULL) return res;
q.push(root);
while (!q.empty()){
vector<int>temp;
int len = q.size();
for(int i = 0;i < len;i++){
//注意这个len不能直接写成q.size(),因为后面有新的插入,会重新计算q.size();
TreeNode * node = q.front();
q.pop();
temp.push_back(node->val);
if(node->left) q.push(node->left);
if(node->right) q.push(node->right);
}
res.push_back(temp);
}
return res;
}
};