思路:判断左子树的左(右)子树及右子树的右(左)子树是否相等
# 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 root is None:
return True
return self.help(root.left, root.right)
def help(self, left, right):
if not left and not right:
return True
if not left:
return False
if not right:
return False
if left.val != right.val:
return False
return self.help(left.left, right.right) and self.help(right.left, left.right)