思路
使用递归。
终止条件为以下3个:
本轮要做的:满足终止条件则返回,不满足则判断左右子树是否相同
代码
# 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):
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)
#当左子树不相同时,右子树不需要再进行判断