把二叉树打印成多行

问题描述

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

来源：牛客网
链接：https://www.nowcoder.com/practice/445c44d982d04483b04a54f298796288?tpId=13&&tqId=11213&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking

C++代码实现

思路：队列，计算每行个数，存储

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