把二叉树打印成多行

从上到下按层打印二叉树，同一层结点从左至右输出。每一层输出一行。

/*
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> > ret;
            
            if(pRoot == nullptr)
            {
                return ret;
            }
            
            deque<TreeNode*> deque_tmp;
            vector<int> print_tree;
            
            deque_tmp.push_back(pRoot);
            
            while(!deque_tmp.empty())
            {
                print_tree.clear();							//清空原有元素
                int deque_size = deque_tmp.size();
                
                while(deque_size--)                    //当队列中还有元素表示这一层元素还没遍历完
                {
                    print_tree.push_back(deque_tmp.front()->val);
                    
                    if(deque_tmp.front()->left)
                    {
                        deque_tmp.push_back(deque_tmp.front()->left);
                    }
                
                    if(deque_tmp.front()->right)
                    {
                        deque_tmp.push_back(deque_tmp.front()->right);
                    }

                    deque_tmp.pop_front();        //出队
                }
                ret.push_back(print_tree);
            }
            return ret;
        }
    
};