LeetCode 366. Find Leaves of Binary Tree

Given a binary tree, find all leaves and then remove those leaves. Then repeat the previous steps until the tree is empty.

Example:
Given binary tree
1
/ \
2 3
/ \
4 5
Returns [4, 5, 3], [2], [1].

Explanation:
1. Remove the leaves [4, 5, 3] from the tree

      1
     / 
    2          

2. Remove the leaf [2] from the tree

      1          

3. Remove the leaf [1] from the tree

      []         

Returns [4, 5, 3], [2], [1].

思路：
1. 找leaf易找，如何删除？需要知道其parent吗？还是直接通过delete?
2. 没必要这么复杂。对leaf标记level=0，每个parent节点level值=max(level of left child, level of righti child)+1。然后按照节点的level号存在vector相应的位置上。
3. 需要提取利用的信息：每个节点的level号。parent node和child node的level号之间的关系也需要能推!

class Solution {
public:
    vector<vector<int>> findLeaves(TreeNode* root) {
        vector<vector<int>> res;
        helper(root,res);
        return res;
    }
    int helper(TreeNode* root,vector<vector<int>>&res){
    //dfs遍历树，左→右→中，post-order traversal
        if(root==NULL) return -1;
        int left=helper(root->left,res);
        int right=helper(root->right,res);
        int level=max(left,right)+1;
        if(res.size()<level+1)
            res.resize(level+1);
        res[level].push_back(root->val);
        return level;
    }
};