牛客网链接
# -*- coding:utf-8 -*-
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def isSymmetrical(self, pRoot):
# write code here
#判断二叉树是否镜像对称
if pRoot == None : return True
return self.judge(pRoot.left,pRoot.right)
def judge(self,left,right):
if left == None and right == None :return True
if left == None or right == None :return False
if left.val == right.val:
return self.judge(left.left,right.right) and self.judge(left.right,right.left)