[Leetcode] 572. Subtree of Another Tree 解题报告

最新推荐文章于 2022-09-28 13:12:56 发布

魔豆Magicbean

最新推荐文章于 2022-09-28 13:12:56 发布

阅读量222

点赞数

CC 4.0 BY-SA版权

分类专栏： IT公司面试习题文章标签： Leetcode 解题报告 Tree

本文链接：https://blog.csdn.net/magicbean2/article/details/78897109

IT公司面试习题专栏收录该内容

736 篇文章

订阅专栏

本文介绍了一种算法，用于判断一棵二叉树是否为另一棵二叉树的子结构。通过先序遍历找到可能相同的节点，并进行递归比对，实现高效查找。

摘要生成于 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:

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.

思路：

练手题目，哈哈。

代码：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool isSubtree(TreeNode* s, TreeNode* t) {
        vector<TreeNode*> nodes;
        preorder(s, nodes);
        for (auto n : nodes) {
            if (sameTree(t, n)) {
                return true;
            }
        }
        return false;
    }
private:
    void preorder(TreeNode *s, vector<TreeNode*> &nodes) {
        if (s == NULL) {
            return;
        }
        nodes.push_back(s);
        preorder(s->left, nodes);
        preorder(s->right, nodes);
    }
    bool sameTree(TreeNode *t1, TreeNode *t2) {
        if (t1 == NULL && t2 == NULL) {
            return true;
        }
        else if (t1 == NULL || t2 == NULL) {
            return false;
        }
        else {
            if (t1->val != t2->val) {
                return false;
            }
            else {
                return sameTree(t1->left, t2->left) && sameTree(t1->right, t2->right);
            }
        }
    }
};