30 lines
636 B
Python
30 lines
636 B
Python
#
|
|
# @lc app=leetcode.cn id=100 lang=python3
|
|
#
|
|
# [100] 相同的树
|
|
#
|
|
|
|
# @lc code=start
|
|
# 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
|
|
|
|
from utils import *
|
|
|
|
|
|
class Solution:
|
|
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)
|
|
|
|
|
|
# @lc code=end
|