【Leetcode-easy-572】Subtree of Another Tree

最新推荐文章于 2021-05-22 16:33:59 发布

LYZ0907

最新推荐文章于 2021-05-22 16:33:59 发布

阅读量699

点赞数 1

分类专栏： Leetcode LeetCode 文章标签：二叉树

本文链接：https://blog.csdn.net/liyazhou0215/article/details/78254746

版权

Leetcode 同时被 2 个专栏收录

50 篇文章

订阅专栏

LeetCode

50 篇文章

订阅专栏

本文介绍LeetCode上编号为572的题目“另一棵树的子树”的解决方案，该题要求判断一棵树是否是另一棵树的子树。通过递归方法验证两棵树结构与节点值是否完全相同。

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

【Leetcode-easy-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.

思路

对比《剑指offer》剑指offer 面试题18 树的子结构

程序

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public boolean isSubtree(TreeNode s, TreeNode t) {
        boolean result = false;
        if (s != null && t != null){
            if (s.val == t.val) result = validate(s, t);
            if (!result) result = isSubtree(s.left, t);
            if (!result) result = isSubtree(s.right, t);
        }
        return result;
    }

    private boolean validate(TreeNode root1, TreeNode root2){
        if (root1 == null && root2 == null) return true;
        // if (root1 == null) return false;
        if (root1 == null && root2 != null) return false;
        if (root1 != null && root2 == null) return false;
        if (root1.val != root2.val) return false;
        return validate(root1.left, root2.left) && validate(root1.right, root2.right);
    }
}

声明：题目来自Leetcode.