solves subtree of another tree

Author: anishLearnsToCode

Diff for: README.md

@@ -150,7 +150,7 @@
 | 561 | [Array Partition I](https://leetcode.com/problems/array-partition-i) | Easy | [![Java](assets/java.png)](src/ArrayPartitionI.java) [![Python](assets/python.png)](python/array_partiton_I.py) |
 | 563 | [Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt) | Easy | [![Java](assets/java.png)](src/BinaryTreeTilt.java) [![Python](assets/python.png)](python/binary_tree_tilt.py) |
 | 566 | [Reshape The Matrix](https://leetcode.com/problems/reshape-the-matrix) | Easy | [![Java](assets/java.png)](src/ReshapeTheMatrix.java) [![Python](assets/python.png)](python/reshape_the_matrix.py) |
-| 572 | [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree) | Easy | |
+| 572 | [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree) | Easy | [![Java](assets/java.png)](src/SubtreeOfAnotherTree.java) [![Python](assets/python.png)](python/subtree_of_another_tree.py) |
 | 575 | [Distribute Candies](https://leetcode.com/problems/distribute-candies) | Easy | |
 | 581 | [Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray) | Easy | |
 | 589 | [N-Ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal) | Easy | |

Diff for: python/subtree_of_another_tree.py

@@ -0,0 +1,18 @@
+# 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 areSame(self, root1: TreeNode, root2: TreeNode) -> bool:
+        if root1 is None and root2 is None: return True
+        if root1 is None or root2 is None: return False
+        return root1.val == root2.val and self.areSame(root1.left, root2.left) and self.areSame(root1.right, root2.right)
+
+    def isSubtree(self, root: TreeNode, subRoot: TreeNode) -> bool:
+        if root is None: return False
+        if root.val == subRoot.val and self.areSame(root, subRoot): return True
+        return self.isSubtree(root.left, subRoot) or self.isSubtree(root.right, subRoot)

Diff for: src/SubtreeOfAnotherTree.java

@@ -0,0 +1,15 @@
+public class SubtreeOfAnotherTree {
+    public boolean isSubtree(TreeNode root, TreeNode subRoot) {
+        if (root == null) return false;
+        if (root.val == subRoot.val && areSame(root, subRoot)) {
+            return true;
+        }
+        return isSubtree(root.left, subRoot) || isSubtree(root.right, subRoot);
+    }
+
+    private boolean areSame(TreeNode root, TreeNode subTree) {
+        if (subTree == null && root == null) return true;
+        if (root == null || subTree == null) return false;
+        return root.val == subTree.val && areSame(root.left, subTree.left) && areSame(root.right, subTree.right);
+    }
+}