【LeetCode】572. Subtree of Another Tree

572. Subtree of Another Tree

Description:
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.
Difficulty:Easy
Example:

Given tree s:

     3
    / \
   4   5
  / \
 1   2
Given tree t:
   4 
  / \
 1   2
 Return true, because t has the same structure and node values with a subtree of s.
方法1: Recursive
  • Time complexity : O ( m ∗ n ) O\left ( m*n\right ) O(mn)
  • Space complexity : O ( n ) O\left ( n\right ) O(n)
    思路:
    遇到这种判断树是否如何的问题,大多是需要比较和递归的,老套路:固定起点,判断是否满足条件,直至到叶子节点。
class Solution {
public:
	bool isSubtree(TreeNode* s, TreeNode* t) {
		if (!s) return false;
		if (helper(s, t)) return true;
		return isSubtree(s->left, t) || isSubtree(s->right, t);
	}

	bool helper(TreeNode* s, TreeNode* t) {
		if (!s && !t) return true;
		if (!s || !t) return false;
		if (s->val != t->val) return false;
		return helper(s->left, t->left) && helper(s->right, t->right);
	}
};
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值