问题:层次遍历二叉树,注意多了个要求:按层输出。
思路:广度优先搜索BFS,用队列存储节点。另外为了满足按层输出的要求,需要用到两个辅助变量:cur_layer_num=0,next_layer_num=0;//当前层有多少个节点,下一层有多少个节点。每次出一个节点,当前层就减1,直到0,说明一层结束。每次进一个节点,下一层就加1,直到当前层减为0,下一层计算完毕。
/**
* 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;
if(root==NULL) return res;
vector<int> layer;
int cur_layer_num=0,next_layer_num=0;//当前层有多少个节点,下一层有多少个节点。每次出一个节点,当前层就减1,直到0,说明一层结束。每次进一个节点,下一层就加1,直到当前层减为0,下一层计算完毕。
queue<TreeNode*> q;
q.push(root);
cur_layer_num++;
while(!q.empty()){
TreeNode* front_node=q.front();
if(front_node->left){
q.push(front_node->left);
next_layer_num++;
}
if(front_node->right){
q.push(front_node->right);
next_layer_num++;
}
layer.push_back(front_node->val);
q.pop();
cur_layer_num--;
if(cur_layer_num==0){
res.push_back(layer);
layer=vector<int>();
cur_layer_num=next_layer_num;
next_layer_num=0;
}
}
return res;
}
};