mirror of
https://github.com/devenperez/leetcode.git
synced 2026-06-13 23:07:08 +00:00
Time: 28 ms (93.78%), Space: 13.8 MB (72.95%) - LeetHub
This commit is contained in:
@@ -0,0 +1,16 @@
|
||||
# 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 == None and q == None:
|
||||
return True
|
||||
|
||||
if p == None or q == None:
|
||||
return False
|
||||
|
||||
if p.val == q.val:
|
||||
return self.isSameTree(p.left, q.left) and self.isSameTree(p.right, q.right)
|
||||
Reference in New Issue
Block a user