LeetCode刷题笔录 Same Tree

最新推荐文章于 2025-05-08 14:25:41 发布

原创最新推荐文章于 2025-05-08 14:25:41 发布 · 755 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #递归 #tree

LeetCode 同时被 3 个专栏收录

114 篇文章

订阅专栏

Java

50 篇文章

订阅专栏

递归

30 篇文章

订阅专栏

本文介绍了一种通过递归方法来判断两棵二叉树是否等价的算法实现。等价条件为两棵树结构相同且节点值相等。代码示例采用Java语言。

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.

基本的递归。先比较当前node，再比较左子树和右子树

public class Solution {
    public boolean isSameTree(TreeNode p, TreeNode q) {
        if(p == null && q == null)
            return true;
        else if(p == null || q == null)
            return false;
        else if(p.val != q.val)
            return false;
        else return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
    }
}