mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
27 lines
1.1 KiB
HTML
27 lines
1.1 KiB
HTML
|
<p>Given the <code>root</code> of a binary tree, return the most frequent <strong>subtree sum</strong>. If there is a tie, return all the values with the highest frequency in any order.</p>
|
||
|
|
|
||
|
|
<p>The <strong>subtree sum</strong> 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).</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Example 1:</strong></p>
|
||
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/24/freq1-tree.jpg" style="width: 207px; height: 183px;" />
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> root = [5,2,-3]
|
||
|
|
<strong>Output:</strong> [2,-3,4]
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong>Example 2:</strong></p>
|
||
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/24/freq2-tree.jpg" style="width: 207px; height: 183px;" />
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> root = [5,2,-5]
|
||
|
|
<strong>Output:</strong> [2]
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li>The number of nodes in the tree is in the range <code>[1, 10<sup>4</sup>]</code>.</li>
|
||
|
|
<li><code>-10<sup>5</sup> <= Node.val <= 10<sup>5</sup></code></li>
|
||
|
|
</ul>
|