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]
]

  采用队列，分层遍历。

/**
 * 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>> ReverseRes;
        if(root == NULL)
            return ReverseRes;
        
        queue<TreeNode*> nodes;
        nodes.push(root);
        while(!nodes.empty())
        {
            int len = nodes.size();
            vector<int> levelRes;
            for(int i=0; i < len; i++)
            {
                root = nodes.front();
                levelRes.push_back(root->val);
                nodes.pop();
                if(root->left)
                    nodes.push(root->left);
                if(root->right)
                    nodes.push(root->right);
            }
             ReverseRes.push_back(levelRes);
        }

        vector<vector<int>> result;
        for(int i= ReverseRes.size() -1; i>=0; i--)
        {
            result.push_back(ReverseRes[i]);
        }
        return result;
    }
};