Skip to content

Added code for Binary tree path sum #7756

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
wants to merge 2 commits into from
Closed

Added code for Binary tree path sum #7756

Changes from 1 commit
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
1abe743
Added code for Binary tree path sum
trisha217 Oct 27, 2022
83cc6ee
[pre-commit.ci] auto fixes from pre-commit.com hooks
pre-commit-ci[bot] Oct 27, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
10 changes: 10 additions & 0 deletions bt_path_sum.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,10 @@
def pathSum(self, root: TreeNode, target_sum: int) -> int:
Copy link

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

As there is no test file in this pull request nor any test function or class in the file bt_path_sum.py, please provide doctest for the function pathSum

Variable and function names should follow the snake_case naming convention. Please update the following name accordingly: pathSum

def dfs(node: TreeNode, sums: List[int]) -> int:
Copy link

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

As there is no test file in this pull request nor any test function or class in the file bt_path_sum.py, please provide doctest for the function dfs

if not node:
return 0
sums = [s + node.val for s in sums] + [node.val]
ans = sums.count(target_sum)
ans += dfs(node.left, sums) if node.left else 0
ans += dfs(node.right, sums) if node.right else 0
return ans
return dfs(root, [])