Leetcode-JavaScript/Path Sum.js at master · parshva45/Leetcode-JavaScript · GitHub

33 lines (30 loc) · 896 Bytes

/*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,

/ \

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.*/

/**

* Definition for a binary tree node.

* function TreeNode(val) {

* this.val = val;

* this.left = this.right = null;

* }

/**

* @param {TreeNode} root

* @param {number} sum

* @return {boolean}

var hasPathSum = function(root, sum) {

if(root == null)

return false

if(root.val == sum && root.left == null && root.right == null)

return true

return hasPathSum(root.left, sum-root.val) || hasPathSum(root.right, sum-root.val)

};

Leetcode-JavaScript/Path Sum.js at master · parshva45/Leetcode-JavaScript · GitHub

Expand file tree

Breadcrumbs

Path Sum.js

Latest commit

History

Breadcrumbs

Path Sum.js

File metadata and controls