[leetcode]100. Same Tree@Java解题报告

最新推荐文章于 2025-04-27 21:49:19 发布

JacobGo

最新推荐文章于 2025-04-27 21:49:19 发布

阅读量374

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode 文章标签： Same Tree leetcode

本文链接：https://blog.youkuaiyun.com/zjkC050818/article/details/76711714

leetcode 专栏收录该内容

130 篇文章

订阅专栏

本文介绍了一种通过递归方法来判断两棵二叉树是否等价的算法。等价的条件为两棵树不仅结构相同，而且每个对应节点的值也完全一致。

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

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

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.

package go.jacob.day805;

public class Demo3 {
	/*
	 * 简单的递归实现
	 */
	public boolean isSameTree(TreeNode p, TreeNode q) {
		if (p == null && q == null)
			return true;
		if (p == null || q == null)
			return false;
		if (p.val == q.val) {
			return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
		}
		return false;
	}

	private class TreeNode {
		int val;
		TreeNode left;
		TreeNode right;

		TreeNode(int x) {
			val = x;
		}
	}
}