most-frequent-subtree-sum

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given the <code>root</code> 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).

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/24/freq1-tree.jpg" style="width: 207px; height: 183px;" />
<pre>
Input: root = [5,2,-3]
Output: [2,-3,4]
</pre>

Example 2:
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/24/freq2-tree.jpg" style="width: 207px; height: 183px;" />
<pre>
Input: root = [5,2,-5]
Output: [2]
</pre>

&nbsp;
Constraints:

<ul>
	<li>The number of nodes in the tree is in the range <code>[1, 104]</code>.</li>
	<li><code>-105 &lt;= Node.val &lt;= 105</code></li>
</ul>

findFrequentTreeSum

Most Frequent Subtree Sum

Subtree of Another Tree

subtree-of-another-tree

另一棵树的子树

Count Nodes Equal to Sum of Descendants

count-nodes-equal-to-sum-of-descendants

值等于子节点值之和的节点数量

Tree

Depth-First Search

Hash Table

Binary Tree

给你一个二叉树的根结点&nbsp;<code>root</code>&nbsp;，请返回出现次数最多的子树元素和。如果有多个元素出现的次数相同，返回所有出现次数最多的子树元素和（不限顺序）。

一个结点的&nbsp;「子树元素和」&nbsp;定义为以该结点为根的二叉树上所有结点的元素之和（包括结点本身）。

&nbsp;

示例 1：

<img src="https://assets.leetcode.com/uploads/2021/04/24/freq1-tree.jpg" />

<pre>
输入: root = [5,2,-3]
输出: [2,-3,4]
</pre>

示例&nbsp;2：

<img src="https://assets.leetcode.com/uploads/2021/04/24/freq2-tree.jpg" />

<pre>
输入: root = [5,2,-5]
输出: [2]
</pre>

&nbsp;

提示:

<ul>
	<li>节点数在&nbsp;<code>[1, 104]</code>&nbsp;范围内</li>
	<li><code>-105&nbsp;&lt;= Node.val &lt;= 105</code></li>
</ul>