二叉树的层序遍历（C++）

力扣https://leetcode.cn/problems/binary-tree-level-order-traversal/

class Solution {
public:
    vector<vector<int>> levelOrder(TreeNode* root) { //返回类型 函数名（参数）

        vector<vector<int>> vv;

        queue<TreeNode*> q;  //存放节点的队列
        int levelsize = 0;   //表示树的每一层节点个数

        if(root)  
        {
            q.push(root);
            levelsize = 1;
        }
        while(!q.empty())
        {
            vector<int> v;
            for(int i = 0; i<levelsize;i++) //控制每一层出队的节点数量
            {
                TreeNode* front = q.front();
                q.pop();

                v.push_back(front->val);

                if(front->left)
                {
                    q.push(front->left);
                }
                if(front->right)
                {
                    q.push(front->right);
                }
            }

            levelsize = q.size(); //更新下一层节点数量
            vv.push_back(v);
        }
        return vv;
    }
};