Time: 118 ms (36.64%) | Memory: 18.9 MB (22.39%) - LeetSync

Author: mrprashantkumar

linked-list-in-binary-tree/linked-list-in-binary-tree.py

@@ -0,0 +1,29 @@
+# Definition for singly-linked list.
+# class ListNode:
+#     def __init__(self, val=0, next=None):
+#         self.val = val
+#         self.next = next
+# 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 isSubPath(self, head: Optional[ListNode], root: Optional[TreeNode]) -> bool:
+        def helper(root, head):
+            if not head:
+                return True
+            
+            if not root:
+                return False
+                
+            if root.val == head.val:
+                return (helper(root.left, head.next) or helper(root.right, head.next))
+        
+        if not head:
+            return True
+        
+        if not root:
+            return False
+        return helper(root, head) or self.isSubPath(head, root.left) or self.isSubPath(head, root.right)