[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.

解题思路：

递归版：

/**
 * 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) {
        travel(root, 1);
        
        reverse(result.begin(), result.end());
        
        return result;
    }
    
    void travel(TreeNode *root, int level) {
        if (!root) return;
        if (level > result.size()) {
            result.push_back(vector<int>());
        }
        
        result[level - 1].push_back(root->val);
        travel(root->left, level + 1);
        travel(root->right, level + 1);
    }
private:
    vector<vector<int>> result;
};

迭代版：

/**
 * 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;
        
        queue<TreeNode *> current, next;
        vector<int> level;
        current.push(root);
        
        while (!current.empty()) {
            while (!current.empty()) {
                TreeNode *tmp = current.front();
                current.pop();
                level.push_back(tmp->val);
                
                if (tmp->left != nullptr) next.push(tmp->left);
                if (tmp->right != nullptr) next.push(tmp->right);
            }
            
            result.push_back(level);
            level.clear();
            swap(current, next);
        }
        
        reverse(result.begin(), result.end());
        
        return result;
    }
};