LeetCode-572. Subtree of Another Tree (JAVA)子树

最新推荐文章于 2024-07-27 17:56:15 发布

mine_song

最新推荐文章于 2024-07-27 17:56:15 发布

阅读量1.9k

点赞数

分类专栏： leetcode 文章标签： java LeetCode 572. Subtree of Anot Another Tree

本文链接：https://blog.csdn.net/mine_song/article/details/72930321

版权

leetcode 专栏收录该内容

155 篇文章 1 订阅

订阅专栏

572. Subtree of Another Tree

Given two non-empty binary trees s and t, check whether tree t has exactly the same structure and node values with a subtree of s. A subtree of s is a tree consists of a node in s and all of this node's descendants. The tree s could also be considered as a subtree of itself.

Example 1:
Given tree s:

Given tree t:

   4 
  / \
 1   2

Return true , because t has the same structure and node values with a subtree of s.

Example 2:
Given tree s:

Given tree t:

   4
  / \
 1   2

Return false .

判断一颗二叉树t是否是一颗二叉树s的子树.

public boolean isSubtree(TreeNode s, TreeNode t) {
	if (s == null)
		return false;
	if (isSame(s, t))
		return true;
	
	return isSubtree(s.left, t) 
			|| isSubtree(s.right, t);
}

private boolean isSame(TreeNode s, TreeNode t) {
	if (s == null && t == null)
		return true;
	if (s == null || t == null)
		return false;

	if (s.val != t.val)
		return false;

	return isSame(s.left, t.left) 
			&& isSame(s.right, t.right);
}