Leetcode100. 相同的树 Same Tree - Python 递归法

princey2100

于 2022-10-14 10:51:19 发布

阅读量108

点赞数

分类专栏： leetcode Leetcode刷题二叉树文章标签： leetcode 算法二叉树 python

本文链接：https://blog.csdn.net/rendalian/article/details/127316113

版权

leetcode 同时被 3 个专栏收录

69 篇文章 0 订阅

订阅专栏

Leetcode刷题

56 篇文章 1 订阅

订阅专栏

二叉树

35 篇文章 0 订阅

订阅专栏

思路：

此题与Leetcode101类似，只需改一下递归的单层逻辑

class Solution:
    def isSameTree(self, p: Optional[TreeNode], q: Optional[TreeNode]) -> bool:
        return self.compare(p,q)

    def compare(self, left: 'TreeNode', right: 'TreeNode') -> bool:
 
        if left == None and right != None: return False
        elif left != None and right == None: return False
        elif not left and not right: return True
        elif left.val != right.val: return False
        else:
            #只需改这里
            leftside = self.compare(left.left, right.left)
            rightside = self.compare(left.right, right.right)
            return leftside and rightside