给出两个二叉树,请写出一个判断两个二叉树是否相等的函数。
判断两个二叉树相等的条件是:两个二叉树的结构相同,并且相同的节点上具有相同的值。
class Solution:
def isSameTree(self, p, q):
if p is None and q is None:
return True
elif (p is None and q is not None) or (p is not None and q is None):
return False
if p.val != q.val:
return False
return self.isSameTree(p.left, q.left) and self.isSameTree(p.right, q.right)