今天正面刚的第二棵树,可是一面对树的问题,我就必须看答案和问大神
day day up:
1,这个就用到了堆栈的思想,将相对应的对称节点最为一对一个元素保存在list中,然后从顶部开始读取元素
class Solution(object): def isSymmetric(self, root): """ :type root: TreeNode :rtype: bool """ if not root: return True stack = [(root.left,root.right)] while stack: left,right = stack.pop() if not left and not right: continue elif not left or not right: return False else: if left.val == right.val: stack.append((left.left,right.right)) stack.append((left.right,right.left)) else: return False return True