feat: same-tree

Author: junbinding

tree.same-tree.py

@@ -0,0 +1,26 @@
+# 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:
+    """
+    100. 相同的树
+    https://leetcode-cn.com/problems/same-tree/
+    给定两个二叉树，编写一个函数来检验它们是否相同。
+    如果两个树在结构上相同，并且节点具有相同的值，则认为它们是相同的。
+    """
+    def isSameTree(self, p: TreeNode, q: TreeNode) -> bool:
+        if not p and not q:
+            return True
+
+        if not p or 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)