solved same tree

Author: SamTheKorean

same-tree/samthekorean.py

@@ -0,0 +1,17 @@
+# Time complexity : O(n)
+# Space complexity : O(n)
+class Solution:
+    def isSameTree(self, p: Optional[TreeNode], q: Optional[TreeNode]) -> bool:
+        if not p and not q:
+            return True
+
+        if not p and q:
+            return False
+
+        if p and not q:
+            return False
+
+        if p.val != q.val:
+            return False
+
+        return self.isSameTree(p.left, q.left) and self.isSameTree(p.right, q.right)