classTreeNode:def__init__(self, x):
self.val = x
self.left =None
self.right =NoneclassSolution:defisSymmetric(self, root: TreeNode)->bool:
Tree =[root]while Tree:
p =[]# 需要一个列表保存当前遍历层节点的值
next_Tree =[]# 需要一个列表保存当前层下一层的节点for point in Tree:ifnot point:
p.append(None)continue
p.append(point.val)
next_Tree.append(point.left)
next_Tree.append(point.right)if p != p[::-1]:returnFalse
Tree = next_Tree
returnTrue