LeetCode: Binary Tree Level Order Traversal II

Problem:

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

与Binary Tree Level Order Traversal类似，最后将vector反序即可。

/**
 * 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) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector< vector<int> > result;  
        if (root == NULL)  
            return result;  
          
        queue<TreeNode*> q;  
        q.push(root);  
        int count = 1;  
        int level = 0;  
        vector<int> tmp(0);  
        while(!q.empty())  
        {  
            tmp.clear();  
            level = 0;  
            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;  
            result.push_back(tmp);  
        } 
        reverse(result.begin(), result.end());
        return result;  
    }
};