leetcode-101-对称二叉树

发表于 阅读次数： 本文字数： 605 阅读时长 ≈ 1 分钟
简介：leetcode-101-对称二叉树

题目

https://leetcode.cn/problems/symmetric-tree/?envType=study-plan-v2&envId=top-100-liked

题解

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def panduan(self, t1: Optional[TreeNode], t2: Optional[TreeNode]):
        if t1 is None and t2 is None:
            return True
        elif t1 is None or t2 is None:
            return False
        elif t1.val != t2.val:
            return False
        
        return self.panduan(t1.left, t2.right) and self.panduan(t1.right, t2.left)
    def isSymmetric(self, root: Optional[TreeNode]) -> bool:
        t1 = root.left
        t2 = root.right
        return self.panduan(t1,t2)