# Problem Definition

## Description

Given a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum.

For example:
Given the below binary tree and sum = 22,

```plaintext
              5
             / \
            4   8
           /   / \
          11  13  4
         /  \    / \
        7    2  5   1
```

return

```plaintext
[
   [5,4,11,2],
   [5,8,4,5]
]
```

## Notes

1. [Geeks for Geeks - Root to leaf path sum equal to a given number](https://www.geeksforgeeks.org/root-to-leaf-path-sum-equal-to-a-given-number/)
1. [ProgramCreek](https://www.programcreek.com/2013/01/leetcode-path-sum/)
1. [GitHub solution - eddie-thp](https://github.com/eddie-thp/codepath-tests/blob/4a2e74be5183c57498dfe85eaa0648a76dfac18e/src/week3/tree/RootToLeafPathWithSums.java)