652. Find Duplicate Subtrees

最新推荐文章于 2021-02-25 22:01:50 发布

转载最新推荐文章于 2021-02-25 22:01:50 发布 · 212 阅读

文章标签：

#Tree

本文介绍了一种算法，用于在给定的二叉树中找出所有重复的子树结构，并仅返回每个重复子树的根节点。通过序列化二叉树的方法，将树的结构转换为字符串形式，进而利用哈希表来识别重复子树。

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

Given a binary tree, return all duplicate subtrees. For each kind of duplicate subtrees, you only need to return the root node of anyone of them.

Two trees are duplicate if they have the same structure with same node values.

Example 1:

The following are two duplicate subtrees:

      2
     /
    4

and

Therefore, you need to return above trees' root in the form of a list.

lass Solution {
public:
    vector<TreeNode*> findDuplicateSubtrees(TreeNode* root) {
        unordered_map<string, vector<TreeNode *>> map;
        vector<TreeNode *> dup;
        serialize(root, map);
        unordered_map<string, vector<TreeNode *>>::iterator it = map.begin();
        for( ; it!=map.end(); it++)
        {
            if(it->second.size()>1)
                dup.push_back(it->second[0]);
        }
        return dup;
    }
    
    string serialize(TreeNode * root, unordered_map<string, vector<TreeNode *>> &mp)
    {
        if(!root) return "";
        string s="(" + serialize(root->left, mp) + to_string(root->val) + serialize(root->right, mp) + ")";
        mp[s].push_back(root);
        return s;
    }
};