把二叉树打印成多行

题目描述

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

 

思路

二叉树层排序。

 

我提交的代码

/*
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 == nullptr) return res;
        queue<TreeNode*> q;
        q.emplace(pRoot);
        while (!q.empty()){
            vector<int> tmp;
            int size = q.size();
            for (int i = 0; i < size; ++i){
                auto cur = q.front();
                q.pop();
                tmp.emplace_back(cur->val);
                if (cur->left) q.emplace(cur->left);
                if (cur->right) q.emplace(cur->right);
            }
            res.emplace_back(tmp);
        }
        return res;
    }
};