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

 

注意动态地增加ans。一开始没有增加ans,就push_back()，这个错误找了半天...

/**
 * 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>> ans;
    
    void dfs(TreeNode* root,int depth){
        if(root){
            if(depth==ans.size()){    //每次出现一个深度，就增加
                vector<int>tmp;
                ans.push_back(tmp);
            }
            ans[depth].push_back(root->val);
            dfs(root->left,depth+1);
            dfs(root->right,depth+1);
        }
    }
    
    vector<vector<int>> levelOrderBottom(TreeNode* root) {       
        dfs(root,0);
        reverse(ans.begin(),ans.end());
        return ans;
    }
};