leetcode101对称二叉树

递归：
思路：判断一个树是否镜像对称即判断根节点的左子树和右子树是否镜像。流程：首先判断两个子树AB的根节点是否相等，如果相等的话判断1、A的左子树是否等于B的右子树以及2、A的右子树==B的右子树。其实这个判断过程就是一个递归的过程，比如我们判断条件1也就是判断两个子树是否镜像，重复流程1、2。代码中把判断流程写进了一个函数isSymmetricRecy()

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    def isSymmetric(self, root):
        """
        :type root: TreeNode
        :rtype: bool
        """
        if not root:
            return True
        return self.isSymmetricRecy(root.left,root.right)
    
    def isSymmetricRecy(self,left,right):
        if left is None and right is None:
            return True
        elif left is None or right is None or left.val != right.val:
            return False
        else:
            return self.isSymmetricRecy(left.left,right.right) and self.isSymmetricRecy(left.right,right.left)

迭代
思路：层序遍历，检查每一层是否是回文数。这个时候的层序遍历不同于以往的层序遍历，要注意当node为None时也要放进列表，并退出本次while loop（因为node=None是没有left和right属性）

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    def isSymmetric(self, root):
        """
        :type root: TreeNode
        :rtype: bool
        """
        if not root:
            return True
        # 层次遍历，检查每层是否是回文数
        stack = [root]
        while stack:
            temp = []
            n = len(stack)
            for i in range(n):
                node = stack.pop(0)
                if not node:
                    temp.append(None)
                    continue
                else:
                    temp.append(node.val)
                stack.append(node.left)
                stack.append(node.right)
            if temp != temp[::-1]:
                return False
        return True