刷题-Same Tree 缺python

最新推荐文章于 2025-12-08 00:32:30 发布

原创最新推荐文章于 2025-12-08 00:32:30 发布 · 357 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#java #python

本文介绍了一个用于检查两棵二叉树是否相同的Java方法。该方法通过递归方式判断两棵树是否结构一致且节点值相等。具体实现包括了对空节点的处理，确保比较过程的准确性。

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.

java：

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

}

}