Leetcode Everyday: 100. Same Tree

最新推荐文章于 2025-04-29 08:42:15 发布

原创最新推荐文章于 2025-04-29 08:42:15 发布 · 208 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

69 篇文章

订阅专栏

本文介绍了一种方法来判断两棵二叉树是否完全相同，即它们的结构相同且节点值相等。通过递归的方式比较两棵树的每个节点，实现了一个简洁高效的算法。

https://leetcode.com/problems/same-tree/

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