# 112 Path Sum

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.

For example:

Given the below binary tree and

`sum = 22`

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

return true, as there exist a root-to-leaf path`5->4->11->2`which sum is 22.

**The Idea**:

* Iterative through the tree and back track when you need to. Keep a global variable that will help you exit from all the recursive call stack.

```cpp
class Solution {
public:
    bool isFound = false;
    bool hasPathSum(TreeNode* root, int sum) {
        hasPathSum_rec(root, sum);
        return isFound;
    }

    void hasPathSum_rec(TreeNode *root, int sum) {
        if (root && !isFound) {
            sum = sum - root->val;
            if (!root->left && !root->right && sum == 0)
                isFound = true;
            else {
                hasPathSum(root->left, sum);
                hasPathSum(root->right, sum);
            }
        }
    }

};
```


---

# 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://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/112-path-sum.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.