给定一个二叉树,返回其按层次遍历的节点值。 (即逐层地,从左到右访问所有节点)。
例如:
给定二叉树: [3,9,20,null,null,15,7]
,
3
/ \
9 20
/ \
15 7
返回其层次遍历结果:
[
[3],
[9,20],
[15,7]
]
采用宽度优先搜索(BFS)求解,代码如下:
/**
* 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>> ans;
void bfs(TreeNode* root){
queue<TreeNode*> q;
q.push(root);
while(!q.empty()){
int size = q.size();
vector<int> l;
while(size --){
TreeNode* t = q.front();
q.pop();
l.push_back(t->val);
if(t->left)
q.push(t->left);
if(t->right)
q.push(t->right);
}
ans.push_back(l);
}
}
vector<vector<int>> levelOrder(TreeNode* root) {
if(root == NULL)
return ans;
bfs(root);
return ans;
}
};