LeetCode 508. Most Frequent Subtree Sum
撰写于 2018-02-27 修改于 2018-02-27 分类 LeetCode
Hi again, happy Chinese New Year, it is a long since that last post. Here is a new LeetCode question on HashTable and Tree, here we go.
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.
return [2, -3, 4], since all the values happen only once, return all of them in any order.
return , 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.
You can solve this problem in 3 steps
For each node,visit the node and nodes of its subtrees and add values of each node including itself and return the sum;
create a map to store the value sum and its counts.
return the result.
And there is a better solution using poster order visiting method from down to top. As you can see in the code.