leetcode【107】Binary Tree Level Order Traversal II

问题描述：

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

    3
   / \
  9  20
    /  \
   15   7

 

return its bottom-up level order traversal as:

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

源码：

和第102题一摸一样的leetcode【32-106】总结C++版。就是末尾加了句reverse反转一下。时间上94%，空间100%，还算可以。

/**
 * Definition for a binary tree node.
 * 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) {
        vector<vector<int>> result;
        if(!root)   return result;
        vector<int> level;
        queue<TreeNode*> st;
        st.push(root);
        int cur=1, nextlevel=0;
        while(!st.empty()){
            TreeNode* tmp = st.front();
            st.pop();
            level.push_back(tmp->val);
            if(tmp->left){
                st.push(tmp->left);     nextlevel++;
            }
            if(tmp->right){
                st.push(tmp->right);     nextlevel++;
            }
            cur--;
            if(cur==0){
                cur = nextlevel;
                nextlevel = 0;
                result.push_back(level);
                level.clear();
            }
        }
        reverse(result.begin(),result.end()); 
        return result;
    }
};