剑指offer No.60 把二叉树打印成多行

/*
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> > res;
        if(pRoot == NULL)
            return res;
        queue<TreeNode*> que;
        que.push(pRoot);
        while(!que.empty())
        {
            vector<int> vec;
            int size = que.size();
            for(int i = 0; i < size; i++)
            {
                TreeNode* temp = que.front();
                vec.push_back(temp->val);
                if(temp->left)
                    que.push(temp->left);
                if(temp->right)
                    que.push(temp->right);
                que.pop();
            }
            res.push_back(vec);
        }
        return res;
    }
};