Merge pull request #1139 from ivan1016017/january01

adding same tree algo

Author: ivan1016017

src/my_project/interviews/top_150_questions_round_12/same_tree.py

@@ -0,0 +1,18 @@
+from typing import List, Union, Collection, Mapping, Optional
+from abc import ABC, abstractmethod
+
+class TreeNode:
+    def __init__(self, val=0, left=None, right=None):
+        self.val = val
+        self.left = left
+        self.right = right
+
+class Solution:
+    def isSameTree(self, p: TreeNode, q: TreeNode) -> bool:
+
+        if p and q: 
+            return p.val == q.val \
+                   and self.isSameTree(p.left, q.left) \
+                   and self.isSameTree(p.right, q.right)
+        else: 
+            return p is q

tests/test_150_questions_round_12/test_same_tree_round_12.py

@@ -0,0 +1,20 @@
+import unittest
+from src.my_project.interviews.top_150_questions_round_12\
+.same_tree import Solution, TreeNode
+
+
+class SameTreeTestCase(unittest.TestCase):
+
+    def test_is_same_tree(self):
+        solution = Solution()
+        tree1 = TreeNode(1, TreeNode(2), TreeNode(3))
+        tree2 = TreeNode(1, TreeNode(2), TreeNode(3))
+        output = solution.isSameTree(p=tree1, q=tree2)
+        return self.assertTrue(output)
+    
+    def test_is_no_same_tree(self):
+        solution = Solution()
+        tree1 = TreeNode(1, TreeNode(2), TreeNode(3))
+        tree2 = TreeNode(1, TreeNode(3), TreeNode(2))
+        output = solution.isSameTree(p=tree1, q=tree2)
+        return self.assertFalse(output)