Leetcode: Same Tree

最新推荐文章于 2021-01-14 14:12:09 发布

LuckySeven7777

最新推荐文章于 2021-01-14 14:12:09 发布

阅读量334

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/LuckySeven7777/article/details/43222607

本文介绍了一种通过递归方法来判断两棵二叉树是否等价的有效算法。等价的二叉树需结构相同且节点值相等。代码示例使用了 Java 语言，并定义了一个二叉树节点类 `TreeNode` 以及一个解决方案类 `Solution`，其中包含核心方法 `isSameTree` 用于实现等价判断。

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

Problem:

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.

Solution:

Use recursive method.

if the value of these two nodes are not the same, return false. Otherwise, check if the left subtree of them are the same and if the right subtree of them are the same (Bothe these two condition must be satisfied).

Code

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public boolean isSameTree(TreeNode p, TreeNode q) {
        if (p == null || q == null) {
            if (p == null && q == null) return true;
            else return false;
        }
        if (p.val != q.val) return false;
        else return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
    }
}