【leetcode】(python) 101. Symmetric Tree 对称树

101. Symmetric Tree Easy

Description

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

Example

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

• Note:
  Bonus points if you could solve it both recursively and iteratively.

题意

判断一棵树是否是对称树，是返回True,否则返回False

解题思路

用递归思想，如果左右子树都为空，则是对称树，如果左右子树都不为空且其值相等，则分别判断左树的左孩子是否等于右树的右孩子 及 左树的右孩子是否等于右树的左孩子。

code

# 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:
            return self.fun(root.left,root.right)
        return True
    
    def fun(self,l,r):
        if l == None and r == None:
            return True
        if l and r and l.val == r.val:
            return self.fun(l.left,r.right) and self.fun(l.right,r.left)
        return False