先对根节点进行判断是否空,之后比较是否相等,然后进而递归比较左儿子和右儿子是否相等,这里不需要进行判空。
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution(object):
def isSameTree(self, p, q):
"""
:type p: TreeNode
:type q: TreeNode
:rtype: bool
"""
if p==None and q==None:
return True
elif p and q and q.val==p.val:
return self.isSameTree(q.left,p.left) and self.isSameTree(q.right,p.right)
return False