【剑指Offer】（树）把二叉树打印成多行

题目链接：https://www.nowcoder.com/practice/7fe2212963db4790b57431d9ed259701?tpId=13&tqId=11175&tPage=2&rp=2&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking

题目描述

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

解决方法

/*
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) return res;
        queue<TreeNode*> q;
        q.push(pRoot);
        while(!q.empty()){
            vector<int> resL;
            int len=q.size();
            while(len--){
                TreeNode *temp=q.front(); q.pop();                
                resL.push_back(temp->val);
                if(temp->left) q.push(temp->left);
                if(temp->right) q.push(temp->right);
            }
            res.push_back(resL);
        }
        return res;
    }    
};