572. Subtree of Another Tree

Author: Partho Biswas

README.md

@@ -417,6 +417,7 @@ Check this [golden](https://tinyurl.com/ujopecz) post.
 |31| **[114. Flatten Binary Tree to Linked List](https://tinyurl.com/yyc6ol5w)**| [Python](https://tinyurl.com/wu6rdaw/114_Flatten_Binary_Tree_to_Linked_List.py)| [Art 1](https://tinyurl.com/v5s5axv) | Medium | Classic Prolem |
 |32| **[297. Serialize and Deserialize Binary Tree](https://tinyurl.com/ycfugzww)**| [Python](https://tinyurl.com/wu6rdaw/297_Serialize_and_Deserialize_Binary_Tree.py), [Swift](https://tinyurl.com/wuja3c4/297_Serialize_and_Deserialize_Binary_Tree.swift) | [Vid 1](https://tinyurl.com/yx4w25u4) | Hard | Classic Prolem |
 |33| **[993. Cousins in Binary Tree](https://tinyurl.com/ybtzjhnb)**| [Python](https://tinyurl.com/wu6rdaw/993_Cousins_in_Binary_Tree.py), [Swift](https://tinyurl.com/wuja3c4/993_Cousins_in_Binary_Tree.swift) |  | Easy(Not so) |  |
+|34| **[572. Subtree of Another Tree](https://tinyurl.com/ybeerky9)**| [Python](https://tinyurl.com/wu6rdaw/572_Subtree_of_Another_Tree.py), [Swift](https://tinyurl.com/wuja3c4/572_Subtree_of_Another_Tree.swift) | [Art 1](https://tinyurl.com/y9epsrfa) | Easy(Not so) |  |
 
 </p>
 </details>

leetcode.com/python/572_Subtree_of_Another_Tree.py

@@ -0,0 +1,52 @@
+# Definition for a binary tree node.
+# class TreeNode(object):
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+
+# My initial approacch
+class Solution(object):
+    def isSubtree(self, s, t):
+        """
+        :type s: TreeNode
+        :type t: TreeNode
+        :rtype: bool
+        """
+        startingNodesOnS = []
+        self.getStartingNodeOnS(s, t.val, startingNodesOnS)
+        if len(startingNodesOnS) <= 0:
+            return False
+
+        for node in startingNodesOnS:
+            if self.isSameTree(node, t):
+                return True
+        return False
+
+    def getStartingNodeOnS(self, s, tVal, startingNodesOnS):
+        if not s:
+            return
+        if s.val == tVal:
+            startingNodesOnS.append(s)
+        leftNode = self.getStartingNodeOnS(s.left, tVal, startingNodesOnS)
+        rightNode = self.getStartingNodeOnS(s.right, tVal, startingNodesOnS)
+        if leftNode:
+            startingNodesOnS.append(leftNode)
+            return
+        elif rightNode:
+            startingNodesOnS.append(rightNode)
+            return
+        else:
+            return
+
+    def isSameTree(self, startingNodeOnS, t):
+        if not startingNodeOnS and not t:
+            return True
+        if startingNodeOnS and t and startingNodeOnS.val == t.val:
+            left = self.isSameTree(startingNodeOnS.left, t.left)
+            right = self.isSameTree(startingNodeOnS.right, t.right)
+            return left and right
+        else:
+            return False
+
+