Binary Tree Level Order Traversal II 二叉树的反向层序遍历

/**
 * Definition for binary tree
 * 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>> ret;
if(root==NULL)  return ret;
vector<int> tmp;
queue<TreeNode*> q;
q.push(root);
int level=0;
int count=1;
while(!q.empty())
{   
level=0;
tmp.clear();
    for(int i=0;i<count;i++)
{
root=q.front();
q.pop();
tmp.push_back(root->val);
if(root->left!=NULL)
{
q.push(root->left);
level++;
}
if(root->right!=NULL)
{
q.push(root->right);
level++;
}
}
count=level;
ret.push_back(tmp);


}
reverse(ret.begin(),ret.end());
return ret;
    }
};