LeetCode 101. 对称二叉树 Python

101. 对称二叉树
     给定一个二叉树，检查它是否是镜像对称的。

例如，二叉树 [1,2,2,3,4,4,3] 是对称的。

1

/
2 2
/ \ /
3 4 4 3

但是下面这个 [1,2,2,null,3,null,3] 则不是镜像对称的:

1

/
2 2
\
3 3

# 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 temp(node,node2):
            if not node and not node2:
                return True
            if not node or not node2:
                return False
            return (node.val==node2.val) and temp(node.left,node2.right) and temp(node.right,node2.left)
        return temp(root,root)

class Solution:
    def isSymmetric(self, root: TreeNode) -> bool:
        if not root:
            return True
        if not root.left and not root.right:
            return True
        seq=[root.left,root.right]
        while seq:
            node,node1=seq.pop(),seq.pop()
            if not node and not node1:
                continue
            if (not node or not node1) or  (node.val != node1.val):
                return False
            seq+=([node.left,node1.right])
            seq+=([node.right,node1.left])
        return True