DSA Visualizations | Hello Interview

Path Sum

DESCRIPTION (credit Leetcode.com)

Given the root of a binary tree and an integer target, write a recursive function to determine if the tree has a root-to-leaf path where all the values along that path sum to the target.

EXAMPLES

Example 1:

Input:


[4, 2, 7, 1, 3, 6, 9]
target = 17

Output: true (the path is 4 -> 7 -> 6)

Example 2:

Input:


[4, 2, 7, 1, 3, 6, 9]
target = 13

Output: false

Run your code to see results here

Explanation

We can solve this problem using the framework established in the Overview section.

Return Values

If I'm at a node in the tree, what values do I need from my child to tell if there's a path from the root to a leaf that sums to the target?

In order for there to be a path from the root to a leaf that sums to the target, there must be a path from either the left or right child to a leaf that sums to target - node.val.

This tells us that each recurisve call should return True if there's a path from the current node to a leaf the sums to the current target, and False otherwise. In the body, we'll make recursive calls to the current node's left and right children, passing in target - node.val for the current target. If either of those calls returns True, then we should return True to the parent.

Base Case If our current node is None, then our subtree is empty and there's no path from the current node to a leaf that sums to the target.

If our current node is a leaf node, then we check if the target is equal to the leaf node's value. If it is, then there's a path from the current node to a leaf that sums to the target.

Helper Functions We need to pass the current target down from parent to children nodes, but this is included in the function signature of the main function, so we don't need to introduce a helper function.

Global Variables The return value of each recurisve call matches the answer to the problem, so we don't need to use any global variables.

Solution

class Solution:
    def pathSum(self, root, target):
        if root is None:
            return False
       
        # if we reach a leaf node, check if the target is equal to the leaf node's value
        if not root.left and not root.right:
            return target == root.val

        target -= root.val
        
        # check if there's a path from the current node to a leaf that sums to target
        return self.pathSum(root.left, target) or self.pathSum(root.right, target)

Animated Solution


def hasPathSum(root, target):
  if not root:
    return False

  if not root.left and not root.right:
    return target == root.val

  left = hasPathSum(root.left, target - root.val)
  right = hasPathSum(root.right, target - root.val)
  return left or right

target: 13

path sum

0 / 13

Complexity Analysis

Time Complexity: O(N) where N is the number of nodes in the tree. We visit each node exactly once, and each node, we perform a constant amount of work, so the time complexity is O(N). Space Complexity: O(N), we have to allocate space for a total of N (one for each nodes) recursive calls on the call stack.

Next: Helper Functions and Global Variables

Your account is free and you can post anonymously if you choose.

Loading comments...

Back to Home

Eliminating Pairs

Overview

Container With Most Water

3-Sum

Triangle Numbers

Pointers as Regions

Move Zeroes

Sort Colors

Trapping Rain Water

Variable-Length

Overview

Longest Substring Without Repeating Characters

Longest Repeating Character Replacement

Fixed-Length

Overview

Maximum Sum of Subarrays of Size K

Max Points You Can Obtain From Cards

Max Sum of Distinct Subarrays Length k

Overview

Can Attend Meetings

Insert Interval

Non-Overlapping Intervals

Merge Intervals

Employee Free Time

Overview

Valid Parentheses

Decode String

Longest Valid Parentheses

Monotonic Stack

Overview

Daily Temperatures

Largest Rectangle in Histogram

Overview

Linked List Cycle

Palindrome Linked List

Remove Nth Node From End of List

Reorder List

Swap Nodes in Pairs

Overview

Apple Harvest (Koko Eating Bananas)

Search in Rotated Sorted Array

Overview

Kth Largest Element in an Array

K Closest Points to Origin

Find K Closest Elements

Merge K Sorted Lists

Introduction

Binary Trees

Overview

Level Order Sum

Rightmost Node

Zigzag Level Order

Maximum Width of Binary Tree

Graphs

Overview

Minimum Knight Moves

Rotting Oranges

01-Matrix

Bus Routes

Overview

Word Search

Solution Space Trees

Subsets

Generate Parentheses

Combination Sum

Topological Sort

Overview

Course Schedule

Course Schedule II

Fundamentals

Solving a Question with Dynamic Programming

Counting Bits

Decode Ways

Maximal Square

Unique Paths

Longest Increasing Subsequence

Word Break

Maximum Profit in Job Scheduling

Overview

Best Time to Buy and Sell Stock

Gas Station

Jump Game

Overview

Implement Trie Methods

Prefix Matching

Overview

Count Vowels in Substrings

Subarray Sum Equals K

Spiral Matrix

Rotate Image

Set Matrix Zeroes

Maximum Depth of a Binary Tree

Helper Functions and Global Variables

Path Sum

DESCRIPTION (credit Leetcode.com)

Given the root of a binary tree and an integer target, write a recursive function to determine if the tree has a root-to-leaf path where all the values along that path sum to the target.

EXAMPLES

Example 1:

Input:


[4, 2, 7, 1, 3, 6, 9]
target = 17

Output: true (the path is 4 -> 7 -> 6)

Example 2:

Input:


[4, 2, 7, 1, 3, 6, 9]
target = 13

Output: false

Run your code to see results here

Explanation

We can solve this problem using the framework established in the Overview section.

Return Values

If I'm at a node in the tree, what values do I need from my child to tell if there's a path from the root to a leaf that sums to the target?

In order for there to be a path from the root to a leaf that sums to the target, there must be a path from either the left or right child to a leaf that sums to target - node.val.

Base Case If our current node is None, then our subtree is empty and there's no path from the current node to a leaf that sums to the target.

If our current node is a leaf node, then we check if the target is equal to the leaf node's value. If it is, then there's a path from the current node to a leaf that sums to the target.

Global Variables The return value of each recurisve call matches the answer to the problem, so we don't need to use any global variables.

Solution

class Solution:
    def pathSum(self, root, target):
        if root is None:
            return False
       
        # if we reach a leaf node, check if the target is equal to the leaf node's value
        if not root.left and not root.right:
            return target == root.val

        target -= root.val
        
        # check if there's a path from the current node to a leaf that sums to target
        return self.pathSum(root.left, target) or self.pathSum(root.right, target)

Animated Solution


def hasPathSum(root, target):
  if not root:
    return False

  if not root.left and not root.right:
    return target == root.val

  left = hasPathSum(root.left, target - root.val)
  right = hasPathSum(root.right, target - root.val)
  return left or right

target: 13

path sum

0 / 13

Complexity Analysis

Next: Helper Functions and Global Variables

Your account is free and you can post anonymously if you choose.

Loading comments...

BlogBehavioral Interview Examples Interviewing for Experienced SWEs All Blog Posts

Compare UsCompare to Interviewing.io

LinksFAQ Schedule Mock Interviews Pricing Become a Coach Our Coaches Learn System Design Learn DSA

LegalTerms and Conditions Privacy Policy

Contactsupport@hellointerview.com7511 Greenwood Ave North
Unit #4238 Seattle, WA 98103