Add leetcode 1482

dev-jelly · dev-jelly · commit 8d8b5b768e24 · 2020-06-24T12:58:07.000+09:00
diff --git a/leetcode/100/solution.py b/leetcode/100/solution.py
@@ -0,0 +1,22 @@
+# 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: TreeNode, q: TreeNode) -> bool:
+        if p is None and q is None:
+            return True
+
+        if p is None or q is None:
+            return False
+
+        if p.val != q.val:
+            return False
+
+        same = self.isSameTree(p.left, q.left)
+        if same:
+            same = self.isSameTree(p.right, q.right)
+
+        return same
