107. Binary Tree Level Order Traversal II

Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).

For example:
Given binary tree [3,9,20,null,null,15,7],

    3
   / \
  9  20
    /  \
   15   7

return its bottom-up level order traversal as:

[
  [15,7],
  [9,20],
  [3]
]

思路：不就是102的結果，最後在一個反轉.....

class Solution {
public:
    vector<vector<int>> levelOrderBottom(TreeNode* root) {
        vector<int> level;
        vector<vector<int>> level_vector;
        
        if(root == NULL) {
            return level_vector;
        }

        queue<TreeNode*> curQueue;
        curQueue.push(root);
        TreeNode* node = NULL;
        while (!curQueue.empty()) {
            
            size_t curLevelSize = curQueue.size();
            for(int index = 0; index < curLevelSize; index++) {
                node = curQueue.front();
                curQueue.pop();
                
                level.push_back(node->val);
                
                if(node->left) {
                    curQueue.push(node->left);
                }
                if(node->right) {
                    curQueue.push(node->right);
                }
            }
            
            level_vector.push_back(level);
            level.clear();
        }
        
        reverse(level_vector.begin(), level_vector.end());
        return level_vector;
    }
};