【leetcode】100. Same Tree

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

ghscarecrow

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

阅读量125

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/ghscarecrow/article/details/86657493

解题报告同时被 2 个专栏收录

203 篇文章

订阅专栏

leetcode题解大全

115 篇文章

订阅专栏

本文探讨了如何通过递归方法检查两棵二叉树是否结构相同且节点值相等。提供了详细的示例输入和输出，以及完整的Java代码实现。

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

Given two binary trees, write a function to check if they are the same or not.

Two binary trees are considered the same if they are structurally identical and the nodes have the same value.

Example 1:

Input:     1         1
          / \       / \
         2   3     2   3

        [1,2,3],   [1,2,3]

Output: true

Example 2:

Input:     1         1
          /           \
         2             2

        [1,2],     [1,null,2]

Output: false

Example 3:

Input:     1         1
          / \       / \
         2   1     1   2

        [1,2,1],   [1,1,2]

Output: false

题解如下：

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