Most Frequent Subtree Sum, is a LeetCode problem. In this post we will see how we can solve this challenge in Python

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

5 / 2 -3

return [2, ....

You can find the full details of the problem Most Frequent Subtree Sum at LeetCode

Solution: Please check the snippet for the solution.

This solution originally posted at: Github by @kamyu104