leetcode Same Tree 1.7 难度系数1

原创于 2014-01-25 11:15:03 发布 · 720 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#java #leetcode

leetcode java 150 专栏收录该内容

86 篇文章

订阅专栏

本文介绍了一种检查两棵二叉树是否等价的方法。通过递归比较两棵树的节点值及其左右子树来判断它们是否结构相同且节点值相等。

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

Question:

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