/**
 * struct TreeNode {
 *	int val;
 *	struct TreeNode *left;
 *	struct TreeNode *right;
 *	TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 * };
 */
class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param pRoot TreeNode类 
     * @return int整型vector<vector<>>
     */
    vector<vector<int> > Print(TreeNode* pRoot) {
        // write code here
        vector<vector<int>> vv;
        if(!pRoot)
        {
            return vv;
        }
        queue<TreeNode*> q;
        q.push(pRoot);
        while(q.size())
        {
            int n=q.size();
            vector<int> v;
            for(int i=0;i<n;i++)
            {
                
                TreeNode* cur=q.front();
                v.push_back(cur->val);
                if(cur->left)
                {
                    q.push(cur->left);
                }
                if(cur->right)
                {
                    q.push(cur->right);
                }
                q.pop();
            }
            vv.push_back(v);
        }
        return vv;
    }
};