力扣题解：二叉树的层序遍历（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>>result;
    vector<vector<int>> levelOrder(TreeNode* root) {
        if(root == NULL)
            return result;
        queue<TreeNode*>que;
        que.push(root);
        while(!que.empty())
        {
            vector<int>res;
            int n = que.size();
            for(int i = 0;i < n;i++)
            {
                TreeNode* node = que.front();
                que.pop();
                res.push_back(node->val);
                if(node->left != NULL)
                    que.push(node->left);
                if(node->right != NULL)
                    que.push(node->right);
            }
            result.push_back(res);
        }
       return result;
    }
};