时间复杂度(O(n)),思想:镜面遍历
# 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 root == None: return True
def is_mirror(root1: TreeNode, root2: TreeNode) -> bool:
if root1 == None and root2 == None:
return True
elif root1 == None or root2 == None:
return False
if root1.val != root2.val:
return False
return is_mirror(root1.left, root2.right) and is_mirror(root1.right, root2.left)
return is_mirror(root.left, root.right)