LeetCode 102.二叉树的层序遍历（二叉树、广度优先遍历bfs）

102.二叉树的层序遍历

思路：广度优先遍历bfs，用变量cnt记住每层需要遍历的元素个数。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    vector<vector<int>> levelOrder(TreeNode* root) {
        vector<vector<int>> v;
        queue<TreeNode *> qu;
        qu.push(root);
        int cnt=1;
        while(qu.size()){
            vector<int> tmp;
            int new_cnt=0;
            while(cnt--){
                TreeNode * q =qu.front();
                qu.pop();
                if(!q) continue;
                tmp.push_back(q->val);
                qu.push(q->left);
                qu.push(q->right);
                new_cnt+=2;
            }
            if(tmp.size())v.push_back(tmp);
            cnt=new_cnt;
        }
        return v;
    }
};