100. 相同的树
使用递归的方法
# 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:# 如果两个节点都为空，返回Trueif not p and not q:return True#如果一个节点为空另一个节点不为空，返回Falseif not p or not q:return False#如果两个节点的值不相同，返回Falseif p.val != q.val:return Falsereturn self.isSameTree(p.left, q.left) and self.isSameTree(p.right, q.right)
)
