g0501_0600.s0508_most_frequent_subtree_sum

Class Solution

java.lang.Object

g0501_0600.s0508_most_frequent_subtree_sum.Solution

public class Solution
extends Object

508 - Most Frequent Subtree Sum.

Medium

Given the root of a binary tree, return the most frequent subtree sum. If there is a tie, return all the values with the highest frequency in any order.

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).

Example 1:

Input: root = [5,2,-3]

Output: [2,-3,4]

Example 2:

Input: root = [5,2,-5]

Output: [2]c

Constraints:

• The number of nodes in the tree is in the range [1, 104].
• -105 <= Node.val <= 105

Constructor Summary

Constructors

Constructor and Description
Solution()

Method Summary

Modifier and Type	Method and Description
int[]	findFrequentTreeSum(TreeNode root)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

Solution

public Solution()

Method Detail

findFrequentTreeSum

public int[] findFrequentTreeSum(TreeNode root)