solves path sum in python

Author: anishLearnsToCode

README.md

@@ -35,7 +35,7 @@
 | 108 | [Convert Sorted Array To Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/ConvertSortedArrayToBinarySearchTree.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/converted_sorted_array_to_binary_search_tree.py) |
 | 110 | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/BalancedBinaryTree.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/balanced_binary_tree.py) | 
 | 111 | [Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/MinimumDepthOfBinaryTree.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/minimum_depth_of_binary_tree.py) | 
-| 112 | [Path Sum](https://leetcode.com/problems/path-sum) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/PathSum.java) | 
+| 112 | [Path Sum](https://leetcode.com/problems/path-sum) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/PathSum.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/path_sum.py) | 
 | 118 | [Pascal's Triangle](https://leetcode.com/problems/pascals-triangle) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/PascalsTriangle.java) | 
 | 119 | [Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/PascalsTriangleII.java) | 
 | 121 | [Best Time to Buy and Sell Stocks](https://leetcode.com/problems/best-time-to-buy-and-sell-stock) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/BestTimeToBuyAndSellStock.java) |

python/path_sum.py

@@ -0,0 +1,30 @@
+# Definition for a binary tree node.
+class TreeNode:
+    def __init__(self, val=0, left=None, right=None):
+        self.val = val
+        self.left = left
+        self.right = right
+
+
+class Solution:
+    def _is_leaf_node(self, node: TreeNode) -> bool:
+        return node.left is None and node.right is None
+
+    def _has_path_sum(self, root: TreeNode, target: int, currentSum: int) -> bool:
+        if root is None:
+            return False
+        currentSum += root.val
+        if self._is_leaf_node(root):
+            return currentSum == target
+        return self._has_path_sum(root.left, target, currentSum) or \
+               self._has_path_sum(root.right, target, currentSum)
+
+    def hasPathSum(self, root: TreeNode, targetSum: int) -> bool:
+        if root is None:
+            return False
+        return self._has_path_sum(root, targetSum, 0)
+
+
+root = TreeNode(val=1)
+root.right = TreeNode(val=2)
+print(Solution().hasPathSum(root, 3))