Limited Time Offer:30% off Hello Interview Premium 🎉

Back to Main

Learn DSA

Introduction

Two Pointers

Overview

Container With Most Water

Two Sum (Sorted Array)

3-Sum

Triangle Numbers

Move Zeroes

Sort Colors

Trapping Rain Water

Sliding Window

Overview

Longest Substring Without Repeating Characters

Longest Repeating Character Replacement

Overview

Maximum Sum of Subarrays of Size K

Max Points You Can Obtain From Cards

Max Sum of Distinct Subarrays Length k

Intervals

Overview

Can Attend Meetings

Insert Interval

Non-Overlapping Intervals

Merge Intervals

Employee Free Time

Stack

Overview

Valid Parentheses

Decode String

Longest Valid Parentheses

Overview

Daily Temperatures

Largest Rectangle in Histogram

Linked List

Overview

Linked List Cycle

Palindrome Linked List

Remove Nth Node From End of List

Reorder List

Swap Nodes in Pairs

Binary Search

Overview

Apple Harvest (Koko Eating Bananas)

Search in Rotated Sorted Array

Heap

Overview

Kth Largest Element in an Array

K Closest Points to Origin

Find K Closest Elements

Merge K Sorted Lists

Breadth-First Search

Introduction

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

Backtracking

Overview

Word Search

Solution Space Trees

Subsets

Generate Parentheses

Combination Sum

Graphs

Overview

Course Schedule

Course Schedule II

Dynamic Programming

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

Greedy Algorithms

Overview

Best Time to Buy and Sell Stock

Gas Station

Jump Game

Trie

Overview

Implement Trie Methods

Prefix Matching

Prefix Sum

Overview

Count Vowels in Substrings

Subarray Sum Equals K

Matrices

Spiral Matrix

Rotate Image

Set Matrix Zeroes

Pricing

Become a Coach

Pricing Become a Coach

Get Premium

Depth-First Search

Path Sum II

medium

DESCRIPTION (credit Leetcode.com)

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

Example 1:

Input:


[1,2,4,4,7,5,1]
target = 10

Output: [[1,2,7],[1,4,5]]. [[1,4,5],[1,2,7]] is also accepted.

The paths are 1 -> 2 -> 7 and 1 -> 4 -> 5

Explanation

This problem is an extension of the Path Sum problem. In this problem, we are asked to return a list of all root-to-leaf paths where the sum of the nodes in the path equals a given target sum.

This is an example of a question which benefits from using a global variable that all recursive calls have access to store the list of all root-to-leaf paths that match the target sum.

Return Values In this case question, we don't need our recursive calls to return any values. Instead, we use depth-first search to traverse each root-to-leaf path in the tree, while maintaining the state of the current path via parameters to the recursive call.

Base Case We can stop recursing when our tree is empty.

Extra Work At each node, we need to add the value of the node to the current path.

Whenever we are at a leaf node, we can check if the value of the current node matches the target. If it does, we can add the current path to the global list of paths.

Helper Function Parent nodes need to pass two pieces of information down to their children:

The remaining target sum
The values along the current path (starting from the root).

These values must be passed down as parameters of the recursive call, so we need to introduce a helper function to help us recurse.

Global Variables We will use a global variable to store the root-to-leaf paths that match the given target. This allows us to avoid h

def dfs(node, target, path):
    # base case
    if not node:
        return

    # append current value to the path
    path.append(node.val)
    if not node.left and not node.right:
        if node.val == target:
            result.append(path[:])
            return

    dfs(node.left, target - node.val, path)
    dfs(node.right, target - node.val, path)

    # when our code reaches here, are done exploring all
    # the root-to-leaf paths that go through the current node.
    # pop the current value from the path to prepare for the next path
    path.pop()

Global Variables We can use a single global variable that all recursive calls have access to store the list of paths that add up to the target sum.

Solution

class Solution:
    def pathSum(self, root, target):
        def dfs(node, target, path):
            # base case
            if not node:
                return

            # append current value to the path
            path.append(node.val)
            if not node.left and not node.right:
                if node.val == target:
                    result.append(path[:])

            dfs(node.left, target - node.val, path)
            dfs(node.right, target - node.val, path)

            # when our code reaches here, are done exploring all
            # the root-to-leaf paths that go through the current node.
            # pop the current value from the path to prepare for the next path
            path.pop()

        result = []
        dfs(root, target, [])
        return result

Animated Solution


def pathSum(root, target):
  def dfs(node, target, path):
    if not node:
      return
    
    path.append(node.val)
    if not node.left and not node.right:
      if node.val == target:
        result.append(path[:])
    
    dfs(node.left, target - node.val, path)
    dfs(node.right, target - node.val, path)
    path.pop()

  result = []
  dfs(root, target, [])
  return result

path sum II

0 / 41

Test Your Knowledge

Complexity Analysis

Time Complexity: O(N) where N is the number of nodes in the binary tree. We visit each node via each recursive call to dfs exactly once. Each recursive call does a constant amount of work.

Space Complexity: O(N) where N is the number of nodes in the binary tree, for the space that it takes to allocate each recursive call frame on the call stack. The space taken up by the result list is in the worst case equal to the number of leaf nodes in the binary tree, which is also O(N).

Next: Longest Univalue Path

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

Depth-First Search

Path Sum II

DESCRIPTION (credit Leetcode.com)

Explanation

Solution

Animated Solution

Test Your Knowledge

Complexity Analysis

Questions

Learn

Links

Legal

Contact