Binary Tree Level Order Traversal II

-----QUESTION-----

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,#,#,15,7},

3 / \ 9 20 / \ 15 7

 

return its bottom-up level order traversal as:

[ [15,7] [9,20], [3], ]

-----SOLUTION-----

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) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        result.clear();
        if(!root) return result;
        
        vector<int> level;
        TreeNode * current;
        queue<TreeNode*> queToPop;
        queue<TreeNode*> queToPush;
        queToPop.push(root);
        while(!queToPop.empty())
        {
            while(!queToPop.empty())
            {
                current = queToPop.front();
                queToPop.pop();
                level.push_back(current->val);
                if(current->left)
                {
                    queToPush.push(current->left);
                }
                if(current->right)
                {
                    queToPush.push(current->right);
                }
            }
           
            result.push_back(level);
            level.clear();
            swap(queToPop, queToPush);
        }
        reverse(result.begin(),result.end());
        return result;
    }
private:
    vector<vector<int>> result;
};