【剑指offer】把二叉树打印成多行

题目描述

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

提示：注意边界条件

/*
struct TreeNode {
    int val;
    struct TreeNode *left;
    struct TreeNode *right;
    TreeNode(int x) :
            val(x), left(NULL), right(NULL) {
    }
};
*/
class Solution {
    struct node
    {
        int val;
        int level;
        TreeNode* root;
        node(int v,int l,TreeNode* t):val(v),level(l),root(t){};
    };
public:
        vector<vector<int> > Print(TreeNode* pRoot) {
            queue<node> q;
            vector<vector<int> > ans;
            vector<int> res;
            if(pRoot!=NULL)
            {
                node n(pRoot->val,0,pRoot);
                q.push(n);
            }
            else
            {
                return ans;
            }
           
            int level_last=0;
            while(!q.empty())
            {
                node temp=q.front();
                q.pop();
                TreeNode* root=temp.root;
                int level=temp.level;
                if(level_last==level)
                {
                    res.push_back(temp.val);
                }
                else
                {
                    level_last=level;
                    ans.push_back(res);
                    res.clear();
                    res.push_back(temp.val);
                }
                if(root->left!=NULL)
                {
                    TreeNode* left=root->left;
                    node nl(left->val,level+1,left);
                    q.push(nl);
                }
                if(root->right!=NULL)
                {
                    TreeNode* right=root->right;
                    node nr(right->val,level+1,right);
                    q.push(nr);
                }
            }
            ans.push_back(res);
            return ans;
        }
    
};