题目分析:
给定一个二叉树,检查它是否是镜像对称的。
例如,二叉树 [1,2,2,3,4,4,3] 是对称的。
但是下面这个 [1,2,2,null,3,null,3] 则不是镜像对称的:
解题思路:
这一题的本质还是遍历,对于树的遍历可使用递归或者栈。
提交代码1:(递归,Runtime: 40 ms, faster than 99.14% )
class Solution:
def isSymmetric(self, root: TreeNode) -> bool:
def dfs(rootl: TreeNode, rootr: TreeNode):
if not rootl and not rootr:
return True
if rootl and not rootr or not rootl and rootr or rootl.val != rootr.val:
return False
return dfs(rootl.right, rootr.left) and dfs(rootl.left, rootr.right)
if root == None: return True
return dfs(root.left, root.right)
提交代码2:(栈,Runtime: 40 ms, faster than 99.14% )
class Solution:
def isSymmetric(self, root: TreeNode) -> bool:
if root == None: return True
stack1 = []
stack2 = []
stack1.append(root.left)
stack2.append(root.right)
while stack1 and stack2:
root1 = stack1.pop()
root2 = stack2.pop()
if (root1 and not root2) or (not root1 and root2): return False
if root1:
if root1.val != root2.val: return False
stack1.append(root1.left)
stack1.append(root1.right)
stack2.append(root2.right)
stack2.append(root2.left)
return True