solved same-tree.

Author: sangbeenmoon

missing-number/sangbeenmoon.py

@@ -0,0 +1,12 @@
+class Solution:
+    def missingNumber(self, nums: List[int]) -> int:
+        visited = {}
+        for num in nums:
+            visited[num] = True
+        for i in range(len(nums) + 1):
+            if i in visited:
+                continue
+            else:
+                return i
+        return 0
+

same-tree/sangbeenmoon.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 isSameTree(self, p: Optional[TreeNode], q: Optional[TreeNode]) -> bool:
+
+        if (p and not q) or (not p and q):
+            return False
+        
+        if not p and not q:
+            return True
+
+        if p.val != q.val:
+            return False
+        return self.isSameTree(p.left, q.left) and self.isSameTree(p.right, q.right)