adding algo

src/my_project/interviews/top_150_questions_round_22/ex_67_same_tree.py

@@ -0,0 +1,19 @@
+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         
+

src/my_project/interviews/top_150_questions_round_22/ex_68_symmetric_binary_tree.py

@@ -0,0 +1,33 @@
+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 isSymmetric(self, root: TreeNode) -> bool:
+        return self.check_mirror(root1=root, root2=root)
+
+    def check_mirror(self, root1: TreeNode, root2: TreeNode):
+
+        if root1 is None and root2 is None:
+            return True
+        elif root1 is not None and root2 is not None:
+            try:
+                root1.val 
+                root2.val 
+            except:
+                return False
+
+            if root1.val != root2.val:
+                return False 
+            else: 
+                return self.check_mirror(root1.left, root2.right) \
+                       and self.check_mirror(root1.right, root2.left)
+        else:
+            return False 
+

src/my_project/interviews_typescript/top_150_questions_round_1/ex_67_same_tree.ts

@@ -0,0 +1,11 @@
+import { TreeNode } from './TreeNode';
+
+function isSameTree(p: TreeNode | null, q: TreeNode | null): boolean {
+    if (p && q) {
+        return p.val === q.val 
+               && isSameTree(p.left, q.left) 
+               && isSameTree(p.right, q.right);
+    } else {
+        return p === q;
+    }
+}

src/my_project/interviews_typescript/top_150_questions_round_1/ex_68_symmetric_binary_tree.ts

@@ -0,0 +1,24 @@
+import { TreeNode } from './TreeNode'; 
+
+function isSymmetric(root: TreeNode | null): boolean {
+    if (!root) return true;
+    return checkMirror(root, root);
+}
+
+function checkMirror(root1: TreeNode | null, root2: TreeNode | null): boolean {
+    if (root1 === null && root2 === null) {
+        return true;
+    } else if (root1 !== null && root2 !== null) {
+        if (root1.val !== root2.val) {
+            return false;
+        } else {
+            return checkMirror(root1.left, root2.right) 
+                   && checkMirror(root1.right, root2.left);
+        }
+    } else {
+        return false;
+    }
+}
+
+
+

tests/test_150_questions_round_22/test_67_same_tree_round_22.py

@@ -0,0 +1,20 @@
+import unittest
+from src.my_project.interviews.top_150_questions_round_22\
+.ex_67_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)
+

tests/test_150_questions_round_22/test_68_symmetric_binary_tree_round_22.py

@@ -0,0 +1,15 @@
+import unittest
+from src.my_project.interviews.top_150_questions_round_22\
+.ex_68_symmetric_binary_tree import Solution, TreeNode
+
+class SymmetricTreeTestCase(unittest.TestCase):
+
+    def test_is_symmetric(self):
+        solution = Solution()
+        output = solution.isSymmetric(TreeNode(1, TreeNode(7), TreeNode(7)))
+        self.assertTrue(output)
+
+    def test_is_no_symmetric(self):
+        solution = Solution()
+        output = solution.isSymmetric(TreeNode(1, TreeNode(2), TreeNode(3)))
+        self.assertFalse(output)