[LeetCode] - Same Tree

最新推荐文章于 2021-01-15 22:01:29 发布

smallfish_yy

最新推荐文章于 2021-01-15 22:01:29 发布

阅读量399

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode Binary Tree

本文链接：https://blog.youkuaiyun.com/smallfish_yy/article/details/17345793

LeetCode 同时被 2 个专栏收录

101 篇文章

订阅专栏

Binary Tree

25 篇文章

订阅专栏

本文介绍如何通过递归方法检查两个二叉树是否结构相同且节点值相等。

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

Description: Given two binary trees, write a function to check if they are equal or not.

Note: 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 isSameTree(TreeNode p, TreeNode q) {
        if(p==null && q==null) return true;
        if((p!=null && q==null) || (p==null && q!=null) || (p.val!=q.val)) return false;
        return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
    }
}