diff --git a/0100_same-tree/README.md b/0100_same-tree/README.md
new file mode 100644
index 0000000..b5617b5
--- /dev/null
+++ b/0100_same-tree/README.md
@@ -0,0 +1,34 @@
+Given the roots of two binary trees `p` and `q`, write a function to check if they are the same or not.
+
+Two binary trees are considered the same if they are structurally identical, and the nodes have the same value.
+
+**Example 1:**
+
+![](https://assets.leetcode.com/uploads/2020/12/20/ex1.jpg)
+
+    Input: p = [1,2,3], q = [1,2,3]
+    Output: true
+    
+
+**Example 2:**
+
+![](https://assets.leetcode.com/uploads/2020/12/20/ex2.jpg)
+
+    Input: p = [1,2], q = [1,null,2]
+    Output: false
+    
+
+**Example 3:**
+
+![](https://assets.leetcode.com/uploads/2020/12/20/ex3.jpg)
+
+    Input: p = [1,2,1], q = [1,1,2]
+    Output: false
+    
+
+**Constraints:**
+
+*   The number of nodes in both trees is in the range `[0, 100]`.
+*   `-104 <= Node.val <= 104`
+
+https://leetcode.com/problems/same-tree/
\ No newline at end of file
diff --git a/0100_same-tree/python3/solution.py b/0100_same-tree/python3/solution.py
new file mode 100644
index 0000000..5ceb6fb
--- /dev/null
+++ b/0100_same-tree/python3/solution.py
@@ -0,0 +1,14 @@
+# 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 is None and q is None:
+            return True
+        elif p is None or q is None or p.val != q.val:
+            return False
+        
+        return self.isSameTree(p.left, q.left) and self.isSameTree(p.right, q.right)