树-101. 对称二叉树-PYTHON

此题目分解成进阶版的判断子树相同即可

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

from collections import deque
class Solution(object):
    def isSymmetric(self, root):
        """
        :type root: TreeNode
        :rtype: bool
        """
        # 递归算法
        
        # # 空树也是对称的
        if not root:
            return True
        def new_trees(root_left,root_right):
            if root_left == None and root_right == None:
                return True
            if root_left == None or root_right ==None:
                return False  
            if root_left.val !=root_right.val:
                return False
            return all((new_trees(root_left.left,root_right.right),new_trees(root_left.right,root_right.left)))
        return new_trees(root.left,root.right)
        



        # 迭代算法
        if not root: #空树也是对称的
            return True
        deq = deque([root.left,root.right]) #构建一个不限制长度的双向链表
        while deq:
            root_right = deq.pop()
            root_left = deq.pop()
            if root_left == None and root_right == None:
                continue
            if root_left == None or root_right == None:
                return False
            if root_left.val != root_right.val:
                return False
            deq.extend([root_left.left,root_right.right,root_left.right,root_right.left])
        return True