反转一下
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
vector<vector<int>> levelOrderBottom(TreeNode* root) {
vector<vector<int>> res;
if(root==nullptr) return res;
queue<TreeNode*> q;
q.push(root);
while(!q.empty())
{
vector<int> tmp;
int num=q.size();
for(int i=0;i<num;i++)
{
root=q.front(); q.pop();
tmp.push_back(root->val);
if(root->left) q.push(root->left);
if(root->right) q.push(root->right);
}
res.push_back(tmp);
}
reverse(res.begin(),res.end());
return res;
}
};