代码思路:利用递归思想,检测每一根结点是否两两相等,且每个树右子树与另一个树的左子树相等
class Solution:
def isSymmetric(self, root: TreeNode) -> bool:
def isMirror(p,q):
if p == None and q == None:
return True
if p == None or q == None:
return False
return isMirror(p.left, q.right) and isMirror(p.right, q.left) and (p.val==q.val)
return isMirror(root,root)