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

    3
   / \
  9  20
    /  \
   15   7

return its bottom-up level order traversal as:

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

 

/**
 * 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) {
        vector< vector<int> > vec;
        if (root == NULL) return vec;
        else{
            list<TreeNode*> queue;
            list<int> level_mark;
            int cur_level = 0;
            queue.push_back(root); //stack[cnt++] = root;
            level_mark.push_back(0);
            vector<int> cur_vec;
            TreeNode* ptr = NULL;
            while (1){
                ptr = queue.front(); //访问队首元素
                if (level_mark.front() != cur_level) {
                    ++cur_level;
                    vec.push_back(cur_vec);
                    cur_vec.clear();
                }
                cur_vec.push_back(ptr->val); //先序遍历
                queue.pop_front(); //出队列
                level_mark.pop_front(); //层标出队列
                if (ptr->left != NULL) {
                    queue.push_back(ptr->left); //左孩子进队列
                    level_mark.push_back(cur_level+1);
                }
                if (ptr->right != NULL) {
                    queue.push_back(ptr->right); //右孩子进队列
                    level_mark.push_back(cur_level+1);
                }
                if (queue.empty()) {
                    vec.push_back(cur_vec);
                    break;
                }
            }
            //翻转vector
            //vector< vector<int> > reverse_vec;
            //while (!vec.empty()) {
            //    reverse_vec.push_back(vec.back());
            //    vec.pop_back();
            //}
            //return reverse_vec;
            reverse(vec.begin(), vec.end());
            return vec;
        }
        
    }
};