分别判断左右子树是否是对称的,判断的时候下判断左右子树的root结点的值是否相等,然后在判断左子树的右子树,右子树的左子树是否相同。
# 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:
def dfs(L, R):
if L is None and R is None:
return True
if L is None or R is None or L.val != R.val:
return False
return dfs(L.left, R.right) and dfs(L.right, R.left)
if not root:
return True
return dfs(root.left, root.right)