32-2分行从上到下打印二叉树

class Solution {
public:
        vector<vector<int> > Print(TreeNode* pRoot) {
            vector<vector<int>>ans;
            if(!pRoot)return ans;
            queue<TreeNode*>q;
            q.push(pRoot);
            while(!q.empty())
            {
                int size=q.size();
                vector<int>temp;
                while(size--)
                {
                    TreeNode*top=q.front();
                    q.pop();
                    temp.push_back(top->val);
                    if(top->left)q.push(top->left);
                    if(top->right)q.push(top->right);
                }
                ans.push_back(temp);
            }
            return ans;
        }
    
};