> For the complete documentation index, see [llms.txt](https://nataliekung.gitbook.io/ladder_code/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://nataliekung.gitbook.io/ladder_code/dfs/find-leaves-of-binary-tree.md).

# Find Leaves of Binary Tree

Given a binary tree, collect a tree's nodes as if you were doing this: Collect and remove all leaves, repeat until the tree is empty.

**Example:**

```
Input: 
[1,2,3,4,5]


1
         / \
        2   3
       / \     
      4   5    


Output: 
[[4,5,3],[2],[1]]
```

**Explanation:**

1. Removing the leaves`[4,5,3]`would result in this tree:

```
          1
         / 
        2
```

1. Now removing the leaf`[2]`would result in this tree:

```
          1
```

1. Now removing the leaf`[1]`would result in the empty tree:

```
          []
```

分析

和上面Nested list ii像，也是底部Level为0.dfs返回层数，里面res插入

```
# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def findLeaves(self, root: TreeNode) -> List[List[int]]:
        res = []

        self.dfs(root,res)
        return res

    def dfs(self, root: TreeNode, res:List[List[int]]) -> int:
        if not root:
            return -1

        level = 1+max(self.dfs(root.left,res),self.dfs(root.right,res))
        if len(res) - 1 < level:
            res+=[[root.val]] #注意【】的 level
        else:
            res[level]+=[root.val]
        return level
```