Time: 75 ms (64.66%) | Memory: 16.8 MB (66.70%) - LeetSync

Author: audemed44

572-subtree-of-another-tree/subtree-of-another-tree.py

@@ -0,0 +1,24 @@
+# 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 isSubtree(self, root: Optional[TreeNode], subRoot: Optional[TreeNode]) -> bool:
+        if not subRoot:
+            return True
+        if not root: 
+            return False
+        if self.isSameTree(root, subRoot):
+            return True
+        return (self.isSubtree(root.left,subRoot) or
+                self.isSubtree(root.right,subRoot))
+
+    def isSameTree(self, root, subRoot):
+        if not root and not subRoot:
+            return True
+        if root and subRoot and root.val == subRoot.val:
+            return (self.isSameTree(root.left, subRoot.left) and 
+                    self.isSameTree(root.right, subRoot.right))
+        return False