mirror of
https://github.com/autistic-symposium/master-algorithms-py.git
synced 2025-05-06 16:55:17 -04:00
add some fun tree playing
This commit is contained in:
parent
48720ada4d
commit
bb72bab679
6 changed files with 209 additions and 0 deletions
21
trees_and_graphs/has_path_sum.py
Normal file
21
trees_and_graphs/has_path_sum.py
Normal file
|
@ -0,0 +1,21 @@
|
|||
def has_path_sum(root: Optional[TreeNode], target_sum: int) -> bool:
|
||||
|
||||
def transverse(node, sum_here=0):
|
||||
|
||||
if not node:
|
||||
return sum_here == target_sum
|
||||
|
||||
sum_here += node.val
|
||||
|
||||
if not node.left:
|
||||
return transverse(node.right, sum_here)
|
||||
if not node.right:
|
||||
return transverse(node.left, sum_here)
|
||||
else:
|
||||
return transverse(node.left, sum_here) or transverse(node.right, sum_here)
|
||||
|
||||
if not root:
|
||||
return False
|
||||
|
||||
return transverse(root)
|
||||
|
Loading…
Add table
Add a link
Reference in a new issue