解题思路:
(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 {
private:
unordered_map<int,int> mp;
public:
int helper(TreeNode* root) {
if(!root) return 0;
int left=helper(root->left);
int right=helper(root->right);
mp[left+right+root->val]++;
return left+right+root->val;
}
vector<int> findFrequentTreeSum(TreeNode* root) {
helper(root);
int maxs=0;
for(auto it=mp.begin();it!=mp.end();it++) {
if(it->second>maxs) maxs=it->second;
}
vector<int> v;
for(auto it=mp.begin();it!=mp.end();it++) {
if(it->second==maxs) v.push_back(it->first);
}
return v;
}
};