leetcode之Same Tree

最新推荐文章于 2025-12-01 13:49:36 发布

原创最新推荐文章于 2025-12-01 13:49:36 发布 · 309 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#same tree #python #leetcode

本文介绍了一种用于比较两棵二叉树是否完全相同的算法实现。通过递归方式逐层对比节点值，确保每一对对应节点的值相等且结构相同。该算法适用于需要精确匹配二叉树结构的场景。

这题就是来看每个节点的值想不想等。看一下左树的值，再看下右树的值来判断的。代码如下：

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    def isSameTree(self, p, q):
        """
        :type p: TreeNode
        :type q: TreeNode
        :rtype: bool
        """
        if p == None:
            if q == None:
                return True
            else:
                return False
        else:
            if q == None:
                return False
        if type(p) != type(q):
            return False
        leftsum = rightsum = True
        if p.val != q.val:
            return False
        else:
            if p.left != None:
                if q.left != None:
                    if p.left.val != q.left.val:
                        return False
                    else:                        
                        leftsum = self.isSameTree(p.left, q.left)
                else:                  
                    return False
            else:
                if q.left != None:
                    return False
            if p.right != None:
                if q.right != None:
                    if p.right.val != q.right.val:
                        return False
                    else:
                        rightsum = self.isSameTree(p.right, q.right)

                else:
                    return False
            else:
                if q.right != None:
                    return False
        return leftsum & rightsum