Leetcode: 101. Symmetric Tree

题目

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).

For example, this binary tree [1,2,2,3,4,4,3] is symmetric:

    1
   / \
  2   2
 / \ / \
3  4 4  3

But the following [1,2,2,null,3,null,3] is not:

    1
   / \
  2   2
   \   \
   3    3

解题思路

递归的方式判断是否对称。

1. 判断根节点是否为空；
2. 新建一个函数判断二者是否对称，先判断是否有一边为空，其次判断它们是值是否相等，是则进入递归，否则返回错。

# 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:
        if root is None:
            return True
        else:
            return self.isSym(root.left, root.right)
        
    def isSym(self, left, right):
        if left is None and right is None:
            return True
        if left is None or right is None:
            return False
        if left.val == right.val:
            tmp1 = self.isSym(left.left, right.right)
            tmp2 = self.isSym(left.right, right.left)
            return tmp1 and tmp2
        else:
            return False

第二中stack的方式
跟递归差不多的思想，但用stack来实现。

class Solution:
    def isSymmetric(self, root: TreeNode) -> bool:
        if root is None:
            return True
        stack = [(root.left, root.right)]
        while stack:
            pair = stack.pop(0)
            left = pair[0]
            right = pair[1]
            if left is None and right is None:
                continue
            if left is None or right is None:
                return False
            if left.val==right.val:
                stack.insert(0, [left.left, right.right])
                stack.insert(0, [left.right, right.left])
            else:
                return False
        return True