Same Tree - LeetCode

最新推荐文章于 2019-04-03 22:45:24 发布

原创最新推荐文章于 2019-04-03 22:45:24 发布 · 574 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

LeetCode 专栏收录该内容

86 篇文章

订阅专栏

本文介绍了一种用于检查两棵二叉树是否等价的方法。等价的定义为两棵树具有相同的结构并且对应节点的值也相同。通过递归方式实现的函数能够有效地完成这一任务。

摘要生成于 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 binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public boolean same(TreeNode r1, TreeNode r2){
        if(r1 == null && r2 == null)
            return true;
        else if (r1 == null && r2 != null)
        return false;
        else if(r1 != null && r2 == null)
        return false;
        else if(r1.val != r2. val){
            return false;
        }
        boolean result1 = same(r1.left, r2.left);
        boolean result2 = same(r1.right, r2.right);
        return result1 && result2;
        
    }
    public boolean isSameTree(TreeNode p, TreeNode q) {
        return same(p,q);
    }
}