一、考察知识点
二叉树的遍历,比较复杂的遍历形式。
二、思路
将二叉树的所有子树都进行序列化存入希哈表中,将重复次数超过2的子序列返回。
重要过程:(1)将所有子树的元素序列化并存储
三、代码
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
vector<TreeNode*> findDuplicateSubtrees(TreeNode* root) {
unordered_map<string, int> counts;
vector<TreeNode*> ans;
serialize(root,counts,ans);
return ans;
}
private:
string serialize(TreeNode* root, unordered_map<string, int>& counts, vector<TreeNode*>& ans){
if (!root) return "#";
string key = to_string(root->val) + ","
+ serialize(root->left, counts, ans) + ","
+ serialize(root->right, counts, ans);
if (++counts[key] == 2){
ans.push_back(root);
}
return key;
}