LeetCode——Find Duplicate Subtrees

最新推荐文章于 2023-02-25 22:41:55 发布

weixin_30657541

最新推荐文章于 2023-02-25 22:41:55 发布

阅读量57

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/zhonghuasong/p/7588731.html

本文介绍了一种查找二叉树中所有重复子树的方法。通过先序遍历并记录每个子树的序列化字符串，可以有效地找出具有相同结构和节点值的重复子树。

Question

Given a binary tree, return all duplicate subtrees. For each kind of duplicate subtrees, you only need to return the root node of any one 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.

Solution

遍历所有子树的情况，遍历每棵子树的时候，采用先序遍历，但是得把空节点考虑进去，这样只有结构一样，遍历得到的字符串才一样。也就是说，先序遍历(不考虑空孩子节点)的结果相同，并不意味着树的结构相同。但是考虑了以后就是唯一的了。

Code

/**
 * 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:
    vector<TreeNode*> findDuplicateSubtrees(TreeNode* root) {
        if (root == NULL)
            return vector<TreeNode*>();
        Trace(root);
        Compare();
        return res;
    }
    // 遍历所有子树
    void Trace(TreeNode* root) {
        if (root != NULL)
            sub1.push_back(root);
        if (root->left != NULL)
            Trace(root->left);
        if (root->right != NULL)
            Trace(root->right);
    }
    void Compare() {
       for (int i = 0; i < sub1.size(); i++) {
           string tmp = "";
           SubTreeStr(sub1[i], tmp);
           if (count.find(tmp) == count.end()) {
               count[tmp] = 1;
           } else
               count[tmp] += 1;
           if (childs.find(tmp) == childs.end())
               childs[tmp] = sub1[i];
       }
        map<string, int>::iterator iter;
        for (iter = count.begin(); iter != count.end(); iter++) {
            if (iter->second > 1)
                res.push_back(childs[iter->first]);
        }
    }
    void SubTreeStr(TreeNode* root1, string& str) {
        // 考虑空节点，才能保证先序遍历的唯一性
        if (root1 == NULL) {
            str += "NULL";
        } else {
            str += to_string(root1->val);
            SubTreeStr(root1->left, str);
            SubTreeStr(root1->right, str);
        }            
    }
    vector<TreeNode*> sub1, res;
    map<string, int> count;
    map<string, TreeNode*> childs;
};

转载于:https://www.cnblogs.com/zhonghuasong/p/7588731.html