leetcode107. 二叉树的层次遍历 II

1、题目

https://leetcode-cn.com/problems/binary-tree-level-order-traversal-ii/submissions/

2、题意

题解1：bfs
和leetcode102一样 最后将res翻转

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<vector<int>> levelOrderBottom(TreeNode* root) {
        vector<vector<int>> res;
        queue<TreeNode*> q;
        if(root) q.push(root);
        while(q.size())
        {
            int len = q.size();
            vector<int> lev;
            for(int i=0;i<len;i++)
            {
                auto t = q.front();
                q.pop();
                lev.push_back(t->val);
                if(t->left) q.push(t->left);
                if(t->right) q.push(t->right);
            }
            res.push_back(lev);
        }
        reverse(res.begin(),res.end());
        return res;
    }
};