Leetcode 101.对称二叉树
1 题目描述(Leetcode题目链接)
给定一个二叉树,检查它是否是镜像对称的。
例如,二叉树 [1,2,2,3,4,4,3] 是对称的。
1
/ \
2 2
/ \ / \
3 4 4 3
但是下面这个 [1,2,2,null,3,null,3] 则不是镜像对称的:
1
/ \
2 2
\ \
3 3
说明:如果你可以运用递归和迭代两种方法解决这个问题,会很加分。
2 题解
迭代方法利用二叉树的层次遍历来做,判断每一层元素是否是回文的。
# 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:
queue = [root]
while queue:
num = len(queue)
level = []
while num:
num -= 1
node = queue.pop(0)
if not node:
level.append(None)
continue
queue.append(node.left)
queue.append(node.right)
level.append(node.val)
if level != level[::-1]:
return False
return True
递归方法很简单
# 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
def helper(root1, root2):
if not root1 and not root2:
return True
if root1 and root2 and root1.val == root2.val:
return helper(root1.left, root2.right) and helper(root1.right, root2.left)
else:
return False
return helper(root.left, root.right)