LeetCode刷题之路：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 judgment(r1: TreeNode, r2: TreeNode):
        #     if (r1 == None) and (r2 == None):
        #         return True
        #     elif (r1 == None) or (r2 == None):
        #         return False
        #     else:
        #         return (r1.val == r2.val) and judgment(r1.left, r2.right) and judgment(r1.right, r2.left) 
        # return judgment(root, root)


        # 迭代
        if not root:
            return True
        queue = [root, root]
        while queue:
            node1 = queue.pop(0)
            node2 = queue.pop(0)
            if node1 or node2:
                if (not node1 and node2) or (node1 and not node2) or (node1.val != node2.val):
                    return False
            if node1 and node2:
                queue.append(node1.left)
                queue.append(node2.right)
                queue.append(node1.right)
                queue.append(node2.left)
        return True