0%

# Path Sum

Posted on 2015-01-04 Edited on 2020-01-12 In leetcode Views: Disqus:

### problem

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,

    1
    2
    3
    4
    5
    6
    7
          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.

### Analysis

using simple deep first search

### code

    1
    2
    3
    4
    5
    6
    7
    8
    9
    10
    11
    12
    13
    14
    15
    16
    17
    18
    19
    20
    21
    22
    23
    24
    25
    26
    27
    28
    /*
      Definition for binary tree
      struct TreeNode {
          int val;
          TreeNode *left;
          TreeNode *right;
          TreeNode(int x) : val(x), left(NULL), right(NULL)}
      };
     */
    class Solution {
    public:
        bool deep_first_search(TreeNode *node, int sum, int curSum)
        {
            if (node == NULL)
                return false;

            if (node->left == NULL && node->right == NULL)
                return curSum + node->val == sum;

            return deep_first_search(node->left, sum, curSum + node->val) || deep_first_search(node->right, sum, curSum + node->val);
        }

        bool hasPathSum(TreeNode *root, int sum) {
            // Start typing your C/C++ solution below
            // DO NOT write int main() function
            return deep_first_search(root, sum, 0);
        }
    };

Related Posts

- binary-watch
- 34_Search_for_a_Range
- leetcode no.3
- Number of 1 Bits
- Reverse Bits

请我喝杯咖啡

WeChat Pay

Alipay

- Post author: Nicksxs
- Post link: https://nicksxs.me/2015/01/04/Path-Sum/
- Copyright Notice: All articles in this blog are licensed under BY-NC-SA unless stating additionally.