LeetCode 101. Symetric Tree

题目

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

例如，二叉树 [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 isMirror(self, root1, root2):
        if root1 == None and root2 == None:
            return True
        if root1 == None or root2 == None:
            return False
        if root1.val != root2.val:
            return False
        return self.isMirror(root1.left, root2.right) and self.isMirror(root1.right, root2.left)
    def isSymmetric(self, root: 'TreeNode') -> 'bool':
        return self.isMirror(root, root)

迭代方法：

class Solution(object):
    def isSymmetric(self, root):
        if not root:
            return True
        stack = []
        stack.append((root.left, root.right))
        
        while stack:
            left, right = stack.pop()
            if not left and not right:
                continue
            elif left and right and left.val == right.val:
                stack.append((left.left, right.right))
                stack.append((left.right, right.left))
            else:
                return False
        
        return True