题目:给定两个二叉树,编写一个函数来检验它们是否相同。
如果两个树在结构上相同,并且节点具有相同的值,则认为它们是相同的。
示例 1:
输入: 1 1
/ \ /
2 3 2 3
[1,2,3], [1,2,3]
输出: true
示例 2:
输入: 1 1
/
2 2
[1,2], [1,null,2]
输出: false
示例 3:
输入: 1 1
/ \ /
2 1 1 2
[1,2,1], [1,1,2]
输出: false
代码:
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def isSameTree(self, p: TreeNode, q: TreeNode) -> bool:
if p is None and q is None:
return True
elif p is not None and q is None:
return False
elif q is not None and p is None:
return False
elif p.val!=q.val:
return False
else:
l=self.isSameTree(p.left,q.left)
r=self.isSameTree(p.right,q.right)
return l and r#取两个结果的与
注意:这种情况下,python使用函数递归时,是self.函数名(参数),如果原函数参数没有self,那递归调用和c语言一样
转载:https://blog.csdn.net/lwycc2333/article/details/80538146