题目描述
给定一个二叉树,检查它是否是镜像对称的。
例如,二叉树 [1,2,2,3,4,4,3]
是对称的。
思路
和剑指offer对称的二叉树一样 https://blog.csdn.net/m0_38098373/article/details/94642889
# 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 isSymmetric(self, root):
"""
:type root: TreeNode
:rtype: bool
"""
if not root:
return True
return self.judge(root,root)
def judge(self,r1,r2):
if not r1 and not r2:
return True
if not r1 or not r2:
return False
if r1.val!=r2.val:
return False
return self.judge(r1.left,r2.right) and self.judge(r1.right,r2.left)