我的算法之路10-- 对称二叉树

joaming

于 2019-04-17 21:30:04 发布

阅读量161

点赞数

CC 4.0 BY-SA版权

分类专栏：算法

本文链接：https://blog.youkuaiyun.com/joaming/article/details/89365370

算法专栏收录该内容

49 篇文章

订阅专栏

本文介绍了一种检查二叉树是否对称的有效方法，包括递归和迭代两种算法实现，通过比较左子树和右子树的镜像来判断整个树的对称性。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None

class Solution:
def isSymmetric(self, root: TreeNode) -> bool:
if not root:
return True
return self.isS(root.left,root.right)
def isS(self,left,right):
if not left and not right:
return True
if left and not right:
return False
if not left and right:
return False

if left.val!=right.val :
return False
return self.isS(left.left,right.right) and self.isS(left.right,right.left)

迭代：

# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None

class Solution:
def isSymmetric(self, root: TreeNode) -> bool:
if not root:
return True
nlist=[root.left,root.right]
while(len(nlist)>0):
l=nlist.pop(-1)
r=nlist.pop(-1)
if not r and not l:
continue
elif not r or not l:
return False
elif l.val!=r.val:
return False
nlist.append(l.left)
nlist.append(r.right)
nlist.append(l.right)
nlist.append(r.left)
return True