kth-largest-sum-in-a-binary-tree

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given the <code>root</code> of a binary tree and a positive integer <code>k</code>.

The level sum in the tree is the sum of the values of the nodes that are on the same level.

Return the <code>kth</code> largest level sum in the tree (not necessarily distinct). If there are fewer than <code>k</code> levels in the tree, return <code>-1</code>.

Note that two nodes are on the same level if they have the same distance from the root.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2022/12/14/binaryytreeedrawio-2.png" style="width: 301px; height: 284px;" />
<pre>
Input: root = [5,8,9,2,1,3,7,4,6], k = 2
Output: 13
Explanation: The level sums are the following:
- Level 1: 5.
- Level 2: 8 + 9 = 17.
- Level 3: 2 + 1 + 3 + 7 = 13.
- Level 4: 4 + 6 = 10.
The 2nd largest level sum is 13.
</pre>

Example 2:
<img alt="" src="https://assets.leetcode.com/uploads/2022/12/14/treedrawio-3.png" style="width: 181px; height: 181px;" />
<pre>
Input: root = [1,2,null,3], k = 1
Output: 3
Explanation: The largest level sum is 3.
</pre>

&nbsp;
Constraints:

<ul>
	<li>The number of nodes in the tree is <code>n</code>.</li>
	<li><code>2 &lt;= n &lt;= 105</code></li>
	<li><code>1 &lt;= Node.val &lt;= 106</code></li>
	<li><code>1 &lt;= k &lt;= n</code></li>
</ul>

kthLargestLevelSum

Kth Largest Sum in a Binary Tree

Binary Tree Preorder Traversal

binary-tree-preorder-traversal

二叉树的前序遍历

Maximum Level Sum of a Binary Tree

maximum-level-sum-of-a-binary-tree

最大层内元素和

Find the Level of Tree with Minimum Sum

find-the-level-of-tree-with-minimum-sum

找到具有最小和的树的层数

Tree

Breadth-First Search

Binary Tree

Sorting

给你一棵二叉树的根节点 <code>root</code> 和一个正整数 <code>k</code> 。

树中的 层和 是指 同一层 上节点值的总和。

返回树中第 <code>k</code> 大的层和（不一定不同）。如果树少于 <code>k</code> 层，则返回 <code>-1</code> 。

注意，如果两个节点与根节点的距离相同，则认为它们在同一层。

&nbsp;

示例 1：

<img alt="" src="https://assets.leetcode.com/uploads/2022/12/14/binaryytreeedrawio-2.png" style="width: 301px; height: 284px;" />

<pre>
输入：root = [5,8,9,2,1,3,7,4,6], k = 2
输出：13
解释：树中每一层的层和分别是：
- Level 1: 5
- Level 2: 8 + 9 = 17
- Level 3: 2 + 1 + 3 + 7 = 13
- Level 4: 4 + 6 = 10
第 2 大的层和等于 13 。
</pre>

示例 2：

<img alt="" src="https://assets.leetcode.com/uploads/2022/12/14/treedrawio-3.png" style="width: 181px; height: 181px;" />

<pre>
输入：root = [1,2,null,3], k = 1
输出：3
解释：最大的层和是 3 。
</pre>

&nbsp;

提示：

<ul>
	<li>树中的节点数为 <code>n</code></li>
	<li><code>2 &lt;= n &lt;= 105</code></li>
	<li><code>1 &lt;= Node.val &lt;= 106</code></li>
	<li><code>1 &lt;= k &lt;= n</code></li>
</ul>