[C++]LeetCode: 32 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]
]

Anwser 1: 非递归方法

思路：BFS IN 后序遍历 直接最后结果reverse。 同Binary Tree Level Order Traversal思路一样。上一题是前序遍历，这题是后序遍历

AC Code:

/**
 * 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) {
        //BFS IN 后序遍历 直接最后结果reverse
        
        vector<int> level;
        vector<vector<int>> ret;
        
        if(root == NULL) return ret;
        
        queue<TreeNode*> TreeQ;
        TreeQ.push(root);
        TreeQ.push(NULL);
        
        while(!TreeQ.empty())
        {
            TreeNode* tmp = TreeQ.front();
            TreeQ.pop();
            
            if(tmp != NULL)
            {
                level.push_back(tmp->val);
                if(tmp->left)   TreeQ.push(tmp->left);
                if(tmp->right)  TreeQ.push(tmp->right);
            }
            else
            {
                ret.push_back(level);
                if(!TreeQ.empty())
                {
                    level.clear();
                    TreeQ.push(NULL);
                }
            }
        }
        
        reverse(ret.begin(), ret.end());
        return ret;
        
    }
};

Anwser 2: 递归方法 (更赞)

Attention: 

1. 先从最左的孩子开始遍历，所以可以以此判断何时增加新的一层（每次只是增加最左的一个节点，所以等于levele值）。DFS遍历是先遍历到树的最左叶子结点，再回退。

2. 会根据相应层添加节点值，并且从左到右。
      “  res[level].push_back(root->val); ”

3. 用逆序迭代器初始化vector.
         "  return vector<vector<int>>(res.rbegin(), res.rend()); "

   <=> "reverse(res.begin(), res.end()); return res;"

AC Code:

/**
 * 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) {
        DFS(root, 0);
        //用反向迭代器初始化vector
        return vector<vector<int>>(res.rbegin(), res.rend());
    }
    
    void DFS(TreeNode* root, int level)
    {
        if(root == NULL) return;
        
        //进行更深一层遍历时，增加一层。
        if(res.size() == level)
        {
            res.push_back(vector<int>());
        }
        
        //会根据相应层添加节点值，并且从左到右。
        res[level].push_back(root->val);
        DFS(root->left, level + 1);
        DFS(root->right, level + 1);
    }
    
private:
    vector<vector<int>> res;
};