Solving Most Frequent Subtree Sum in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

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 1Input:

 /  \
2   -3

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

Examples 2Input:

 /  \
2   -5

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

See the full details of the problem Most Frequent Subtree Sum at LeetCode

Originally posted at: