leetcode 102 Binary Tree Level Order Traversal C++

和107差了一个逆序

class Solution {
public:
    vector<vector<int>> levelOrder(TreeNode* root) {
        vector<vector<int>> res;  
        if(!root) return res;  
        queue<TreeNode*> que;  
        que.push(root);  
        while(que.size()!=0){  
            vector<int> tmpRes;  
            queue<TreeNode*> tmpQue;  
            while(que.size()!=0){  
                TreeNode *node = que.front();  
                que.pop();  
                if(node->left) tmpQue.push(node->left);  
                if(node->right) tmpQue.push(node->right);  
                tmpRes.push_back(node->val);  
            }  
            res.push_back(tmpRes);  
            que = tmpQue;  
        }  
        // reverse(res.begin(),res.end());  
        return res; 
    }
};