Package g0501_0600.s0508_most_frequent_subtree_sum

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    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

    Constraints:

    • The number of nodes in the tree is in the range <code>1, 10<sup>4</sup></code>.

    • <code>-10<sup>5</sup><= Node.val <= 10<sup>5</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final IntArray findFrequentTreeSum(TreeNode root)

      • Methods inherited from class java.lang.Object

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