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

# 366 Find Leaves of Binary Tree

### Problem:

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: Given binary tree

```
          1
         / \
        2   3
       / \     
      4   5    
```

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

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

```
          1
         / 
        2     
```

2 Now removing the leaf \[2] would result in this tree:

```
          1          
```

3 Now removing the leaf \[1] would result in the empty tree:

```
          []         
```

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

### Solutions:

```java
/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public List<List<Integer>> findLeaves(TreeNode root) {
        List<List<Integer>> result = new LinkedList<List<Integer>>();
        dfs(result, root);
        return result;
    }
    private int dfs(List<List<Integer>> result, TreeNode node) {
        if (node == null) {
            return 0;
        }
        int left = dfs(result, node.left);
        int right = dfs(result, node.right);
        int curr = Math.max(left, right) + 1;
        if (result.size() < curr) {
            result.add(new LinkedList());
        }
        result.get(curr - 1).add(node.val);
        return curr;
    }
}
```


---

# Agent Instructions
This documentation is published with GitBook. GitBook is the documentation platform designed so that both humans and AI agents can read, navigate, and reason over technical content effectively. Learn more at gitbook.com.

## Querying This Documentation
If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://ugopireddy.gitbook.io/leet-code-solutions/solutions-351---400/366-find-leaves-of-binary-tree.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.