LetCode 107. 二叉树的层次遍历 II

/**
 * 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;
        if (root == NULL)
            return res;
        queue<TreeNode*> q;
        q.push(root);
        while(!q.empty()){
            // 这层树的节点个数
            int nums = q.size();
            vector<int> v;
            for (int i = 0; i < nums; i++){
                TreeNode* tmp = q.front();
                q.pop();
                if (tmp->left != NULL)
                    q.push(tmp->left);
                if (tmp->right != NULL)
                    q.push(tmp->right);
                v.push_back(tmp->val);
            }
            res.push_back(v);
        }     
        // 与一一样，只需要这里逆序即可
        reverse(res.begin(),res.end());
        return res;
    }
};

static int x=[](){
    std::ios::sync_with_stdio(false);
    cin.tie(NULL);
    return 0;
}();