508. Most Frequent Subtree Sum

Given the root of a tree, you are asked to find the most frequent subtree sum. The subtree sum of a node is defined as the sum of all the node values formed by the subtree rooted at that node (including the node itself). So what is the most frequent subtree sum value? If there is a tie, return all the values with the highest frequency in any order.

Examples 1
Input:

  5
 /  \
2   -3

return [2, -3, 4], since all the values happen only once, return all of them in any order.

Examples 2
Input:

  5
 /  \
2   -5

return [2], since 2 happens twice, however -5 only occur once.

Note: You may assume the sum of values in any subtree is in the range of 32-bit signed integer.

/**
 * 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 {
    void dfs(TreeNode* root,TreeNode* &  t,map & m,int& freq)
    {//t用来记录每个节点的和，map 是val to freq,记录每个数值的出现频率，freq记录最大出现的频率
        if(root==NULL) return;
        t=new TreeNode(root->val);
        if(root->left) {
            dfs(root->left,t->left,m,freq);
            t->val+=t->left->val;
        }
        if(root->right)
        {
            dfs(root->right,t->right,m,freq);
            t->val+=t->right->val;
        }
        m[t->val]++;
        freq=max(freq,m[t->val]);
    }
    
public:
    vector findFrequentTreeSum(TreeNode* root) {
       vector r;
        TreeNode*  t;
        map  m;int freq=0;
        dfs(root,t,m,freq);
        //cout<<"freq:" <second==freq)
            r.push_back(it->first);
        }
        return r; 
    }
};