Binary Tree Level Order Traversal II

Description:

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]
]

Code:

 vector<vector<int>> levelOrderBottom(TreeNode* root) {
           deque<TreeNode*>a;
       deque<TreeNode*>b;
       if (root)
            a.push_back(root);
        
       TreeNode*p = NULL;
       vector<vector<int>> result;
       
       while (!a.empty() || !b.empty())
       {
           vector<int>temp;
           if (!a.empty() )
           {
                while (!a.empty() )
                {
               p = a.front();
               a.pop_front();
               temp.push_back(p->val);
               if (p->left)
                    b.push_back(p->left);
                if (p->right)
                    b.push_back(p->right);
                }
                result.push_back(temp);
           }
           else
           {
            while (!b.empty())
           {
               p = b.front();
               b.pop_front();
               temp.push_back(p->val);
               if (p->left)
                    a.push_back(p->left);
               if (p->right)
                    a.push_back(p->right);
           }
           result.push_back(temp);
           }
       }
       reverse(result.begin(),result.end());
       return result;  
    }