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   7return 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>> res;        if(!root) return res;        queue<TreeNode*> q;        q.push(root);        while(!q.empty())        {            int len=q.size();            vector<int> tmp;            for(int i=0;i<len;i++)            {                TreeNode* node=q.front();                q.pop();                tmp.push_back(node->val);                if(node->left) q.push(node->left);                if(node->right) q.push(node->right);            }            res.push_back(tmp);        }        reverse(res.begin(),res.end());        return res;    }};