[Leetcode]@python 100. Same Tree

最新推荐文章于 2025-09-12 17:31:31 发布

weixin_30817749

最新推荐文章于 2025-09-12 17:31:31 发布

阅读量61

点赞数

CC 4.0 BY-SA版权

文章标签：数据结构与算法 python

原文链接：http://www.cnblogs.com/slurm/p/5221601.html

本文介绍了一种利用递归方法来判断两棵二叉树是否完全相同（包括结构与节点值）的解决方案，并提供了完整的Python实现代码。

题目链接

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

题目原文

Given two binary trees, write a function to check if they are equal or not.

Two binary trees are considered equal if they are structurally identical and the nodes have the same value.

题目大意

给定两棵二叉树，判断这两棵树是否相同（需同时满足结构相同和节点的值相同）

解题思路

递归

代码

# 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 and q == None:
            return True
        if p and q and p.val == q.val:
            return self.isSameTree(p.left, q.left) and self.isSameTree(p.right, q.right)
        return False

转载于:https://www.cnblogs.com/slurm/p/5221601.html