LeetCode 刷题记录: 101. Symmetric Tree [Python]

原题

https://leetcode.com/problems/symmetric-tree/

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

思路

递归判断左节点的左边是否等于右节点的右边。

代码

# 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:
        def isSym(L,R):
            if not L and not R: return True
            if L and R and L.val==R.val:
                return isSym(L.left,R.right) and isSym(L.right,R.left)
        return isSym(root,root)

# LeetCode

支付宝

微信

Paypal Buy me a coffee

LeetCode 刷题记录: 101. Symmetric Tree [Python]

原题

思路

代码

喜欢这篇文章？打赏一下作者吧

评论

分类

标签

最新文章

归档

最新文章

归档

Your browser is out-of-date!