1、深度优先搜索
活用递归
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:
def isSymmetric(self, root: TreeNode) -> bool:
return self.f(root,root)
# 开始搜索
def f(self,left:TreeNode,right:TreeNode):
# 递归结束条件
if not left and not right:
return True
elif not left or not right or left.val != right.val:
return False
else:
# 对称的条件
return self.f(left.left,right.right) and self.f(left.right,right.left)