100. Same Tree--LeetCode Record

最新推荐文章于 2020-12-18 19:21:43 发布

Tong_hdj

最新推荐文章于 2020-12-18 19:21:43 发布

阅读量234

点赞数

CC 4.0 BY-SA版权

分类专栏：刷题文章标签： LeetCode

本文链接：https://blog.youkuaiyun.com/schostel/article/details/51873496

刷题专栏收录该内容

27 篇文章

订阅专栏

本文介绍了一种检查两棵二叉树是否完全相同的算法。该算法通过递归方式比较两棵树的结构及节点值来判断它们是否一致。当两棵树的结构相同且每个对应节点的值相等时，认为这两棵树是相同的。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.
 * public class TreeNode {
 *     public var val: Int
 *     public var left: TreeNode?
 *     public var right: TreeNode?
 *     public init(_ val: Int) {
 *         self.val = val
 *         self.left = nil
 *         self.right = nil
 *     }
 * }
 */
class Solution {
    func isSameTree(p: TreeNode?, _ q: TreeNode?) -> Bool {
        if p == nil && q == nil {
            return true
        }else if p == nil || q == nil {
            return false
        }else if p?.val == q?.val {
            return isSameTree(p?.left, q?.left) == true  && isSameTree(p?.right, q?.right) == true
        }else {
            return false
        }
    }
}