# 30. Path Sum III

You are given a binary tree in which each node contains an integer value.

Find the number of paths that sum to a given value.

The path does not need to start or end at the root or a leaf, but it must go downwards (traveling only from parent nodes to child nodes).

The tree has no more than 1,000 nodes and the values are in the range -1,000,000 to 1,000,000.

**Example:**

```
root = [10,5,-3,3,2,null,11,3,-2,null,1], sum = 8

      10
     /  \
    5   -3
   / \    \
  3   2   11
 / \   \
3  -2   1

Return 3. The paths that sum to 8 are:

1.  5 -> 3
2.  5 -> 2 -> 1
3. -3 -> 11
```

## Solution: (Using Prefix Sum on tree)

```cpp
class Solution
{
public:
    unordered_map<int, int> m;
    int count = 0;
    
    void traverse(TreeNode *root, int sum, int target)
    {

        if (root == NULL)
        {
            return;
        }

        int s = sum + root->val;
        
        if (s == target)
        {
            count++;
        }

        if (m.find(s - target) != m.end())
        {
            count += m[s - target];
        }

        m[s]++;

        traverse(root->left, s, target);
        traverse(root->right, s, target);
        m[s]--;

        return;
    }

    int pathSum(TreeNode *root, int sum)
    {

        if (root == NULL)
        {
            return 0;
        }

        traverse(root, 0, sum);

        return count;
    }
};
```

**Time Complexity: O(n)**


---

# Agent Instructions: 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://soumyajit4419.gitbook.io/ds-algo/binary-tree/problems-related-to-binary-trees/30.-path-sum-iii.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.