AcWing 39. 对称的二叉树
原题链接
简单
作者:
YoloVMe50
,
2023-12-12 17:14:53
,
所有人可见
,
阅读 40
py代码
# 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.isSame(root.left,root.right)
def isSame(self,le,ri):
if le is None and ri is None:
return True
if le is None or ri is None or le.val != ri.val:
return False
return self.isSame(le.left,ri.right) and self.isSame(le.right,ri.left)