LeetCode-100. Same Tree(Easy)(python)

最新推荐文章于 2025-08-07 20:34:46 发布

原创最新推荐文章于 2025-08-07 20:34:46 发布 · 165 阅读

0 ·

CC 4.0 BY-SA版权

编程刷题专栏收录该内容

33 篇文章

订阅专栏

文章目录

前言
1. 题目
2. 代码

前言

两个二叉树比较，使用递归的方法。

1. 题目

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

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

Example 1:

Input:     1         1
          / \       / \
         2   3     2   3

        [1,2,3],   [1,2,3]

Output: true

Example 2:

Input:     1         1
          /           \
         2             2

        [1,2],     [1,null,2]

Output: false

Example 3:

Input:     1         1
          / \       / \
         2   1     1   2

        [1,2,1],   [1,1,2]

Output: false

2. 代码

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

class Solution:
    def isSameTree(self, p: TreeNode, q: TreeNode) -> bool:
        if p == None and q == None:
            return True
        if p != None and q == None:
            return False
        if p == None and q != None:
            return False
        return p.val == q.val and self.isSameTree(p.left,q.left) and self.isSameTree(p.right,q.right)