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: OptionalTreeNode, q: OptionalTreeNode) -> 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.right,q.right) and self.isSameTree(p.left,q.left)