LeetCode572 另一棵树的子树

fruit513

于 2019-01-02 10:21:32 发布

阅读量1.5k

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/fruit513/article/details/85599871

本文探讨了如何检查一棵二叉树是否为另一棵二叉树的子结构。通过递归算法，首先判断两棵树的根节点是否相同，然后分别检查左子树和右子树。如果找到完全相同的子树，则返回真；否则继续在源树的左子树和右子树中寻找目标树。

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

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:

 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.
Example 2:
Given tree s:

 3
/ \

4 5
/
1 2
/
0
Given tree t:
4
/
1 2
Return false.

class Solution {
    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);
    }
    public boolean isSame(TreeNode s, TreeNode t){
        if(s == null || t == null) return s == t;
        if(s.val != t.val) return false;
        return isSame(s.left,t.left) && isSame(s.right,t.right);
    }
}