leetcode 100. Same Tree

最新推荐文章于 2024-07-18 16:07:51 发布

原创最新推荐文章于 2024-07-18 16:07:51 发布 · 288 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

13 篇文章

订阅专栏

本文介绍了一种方法来检查两棵二叉树是否相等。通过递归地比较两个二叉树的节点值和结构，可以确定它们是否完全相同。文章提供了具体的实现代码，并解释了递归出口和时机的选择。

摘要生成于 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.

Subscribe to see which companies asked this question

思考：遍历两个树的过程中比较，注意递归的出口和递归的时机。

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

            return ret;
        }else{
            return false;
        }

    }
}