113. Path Sum II "python" | LeetCode

Published: 24 September 2022
on channel: Sugar Coat

136

Given the root of a binary tree and an integer targetSum, return all root-to-leaf paths where the sum of the node values in the path equals targetSum. Each path should be returned as a list of the node values, not node references.

A root-to-leaf path is a path starting from the root and ending at any leaf node. A leaf is a node with no children.

Example 1:
Input: root = [5,4,8,11,null,13,4,7,2,null,null,5,1], targetSum = 22
Output: [[5,4,11,2],[5,8,4,5]]
Explanation: There are two paths whose sum equals targetSum:
5 + 4 + 11 + 2 = 22
5 + 8 + 4 + 5 = 22

Example 2:
Input: root = [1,2,3], targetSum = 5
Output: []

Example 3:
Input: root = [1,2], targetSum = 0
Output: []

code:
https://github.com/anandchauhan21/dai...

profile:
https://linktr.ee/anandchauhan

Path Sum ii
Path Sum
path sum

On this page of the site you can watch the video online 113. Path Sum II "python" | LeetCode with a duration of hours minute second in good quality, which was uploaded by the user Sugar Coat 24 September 2022, share the link with friends and acquaintances, this video has already been watched 136 times on youtube and it was liked by 6 viewers. Enjoy your viewing!

331