剑指数据结构-把二叉树打印成多行

/*
struct TreeNode {
    int val;
    struct TreeNode *left;
    struct TreeNode *right;
    TreeNode(int x) :
            val(x), left(NULL), right(NULL) {
    }
};
*/
class Solution {
public:
        vector<vector<int> > Print(TreeNode* pRoot) {
            vector<vector<int> >  sa;
            if (!pRoot) return sa;
            queue<TreeNode*> q;
            q.push(pRoot);
            while(!q.empty())
            {
                int s = q.size(); 
                vector<int> n;
                while(s--)
                {
                    TreeNode *node = q.front();
                    q.pop();
                    n.push_back(node->val);

                    if(node->left) q.push(node->left);
                    if(node->right) q.push(node->right);
                }
                sa.push_back(n);
            }
        return sa;
        }
};