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

confused what "{1,#,2,3}" means? > read more on how binary tree is serialized on OJ.

» Solve this problem

/**
 * 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> > answer;
        if (root != NULL) {
            list<TreeNode *> pre, cur;
            pre.push_back(root);            
            while (!pre.empty()) {
                vector<int> temp;
                for (list<TreeNode *>::iterator iter = pre.begin(); iter != pre.end(); iter++) {
                    temp.push_back((*iter)->val);
                }
                answer.push_back(temp);
                
                cur.clear();
                for (list<TreeNode *>::iterator iter = pre.begin(); iter != pre.end(); iter++) {
                    if ((*iter)->left != NULL) {
                        cur.push_back((*iter)->left);
                    }
                    if ((*iter)->right != NULL) {
                        cur.push_back((*iter)->right);                        
                    }
                }                
                pre = cur;
            }
        }        
        vector<vector<int> > rev_answer;
        for (int i = 0; i < answer.size(); i++) {
            rev_answer.push_back(answer[answer.size() - i - 1]);
        }
        return rev_answer;
    }
};

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ArrayList<ArrayList<Integer>> levelOrderBottom(TreeNode root) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        LinkedList<ArrayList<Integer>> answer = new LinkedList<ArrayList<Integer>>();
        if (root != null) {
            LinkedList<TreeNode> currentLevelNode = new LinkedList<TreeNode>();
            currentLevelNode.add(root);
            while (!currentLevelNode.isEmpty()) {
                ArrayList<Integer> temp = new ArrayList<Integer>(currentLevelNode.size());
                LinkedList<TreeNode> nextLevelNode = new LinkedList<TreeNode>();
                for (TreeNode node : currentLevelNode) {
                    temp.add(node.val);
                    if (node.left != null) {
                        nextLevelNode.add(node.left);
                    }
                    if (node.right != null) {
                        nextLevelNode.add(node.right);
                    }
                }
                answer.add(0, temp);
                currentLevelNode = nextLevelNode;
            }
        }
        return new ArrayList<ArrayList<Integer>>(answer);
    }
}