• Home
• com.github.javadev
• leetcode-in-java
• 1.38
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g0501_0600.s0508_most_frequent_subtree_sum.readme.md Maven / Gradle / Ivy

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:**

![](https://assets.leetcode.com/uploads/2021/04/24/freq1-tree.jpg)

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

**Output:** [2,-3,4]

**Example 2:**

![](https://assets.leetcode.com/uploads/2021/04/24/freq2-tree.jpg)

**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