insufficient-nodes-in-root-to-leaf-paths

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 and an integer <code>limit</code>, delete all insufficient nodes in the tree simultaneously, and return the root of the resulting binary tree.

A node is insufficient if every root to leaf path intersecting this node has a sum strictly less than <code>limit</code>.

A leaf is a node with no children.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2019/06/05/insufficient-11.png" style="width: 500px; height: 207px;" />
<pre>
Input: root = [1,2,3,4,-99,-99,7,8,9,-99,-99,12,13,-99,14], limit = 1
Output: [1,2,3,4,null,null,7,8,9,null,14]
</pre>

Example 2:
<img alt="" src="https://assets.leetcode.com/uploads/2019/06/05/insufficient-3.png" style="width: 400px; height: 274px;" />
<pre>
Input: root = [5,4,8,11,null,17,4,7,1,null,null,5,3], limit = 22
Output: [5,4,8,11,null,17,4,7,null,null,null,5]
</pre>

Example 3:
<img alt="" src="https://assets.leetcode.com/uploads/2019/06/11/screen-shot-2019-06-11-at-83301-pm.png" style="width: 250px; height: 199px;" />
<pre>
Input: root = [1,2,-3,-5,null,4,null], limit = -1
Output: [1,null,-3,4]
</pre>

&nbsp;
Constraints:

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

sufficientSubset

Insufficient Nodes in Root to Leaf Paths

Count Nodes Equal to Average of Subtree

count-nodes-equal-to-average-of-subtree

统计值等于子树平均值的节点数

Tree

Depth-First Search

Binary Tree

给你二叉树的根节点 <code>root</code> 和一个整数 <code>limit</code> ，请你同时删除树中所有 不足节点 ，并返回最终二叉树的根节点。

假如通过节点 <code>node</code> 的每种可能的 “根-叶” 路径上值的总和全都小于给定的 <code>limit</code>，则该节点被称之为 不足节点 ，需要被删除。

叶子节点，就是没有子节点的节点。

&nbsp;

示例 1：
<img alt="" src="https://assets.leetcode.com/uploads/2019/06/05/insufficient-11.png" style="width: 500px; height: 207px;" />
<pre>
输入：root = [1,2,3,4,-99,-99,7,8,9,-99,-99,12,13,-99,14], limit = 1
输出：[1,2,3,4,null,null,7,8,9,null,14]
</pre>

示例 2：
<img alt="" src="https://assets.leetcode.com/uploads/2019/06/05/insufficient-3.png" style="width: 400px; height: 274px;" />
<pre>
输入：root = [5,4,8,11,null,17,4,7,1,null,null,5,3], limit = 22
输出：[5,4,8,11,null,17,4,7,null,null,null,5]
</pre>

示例 3：
<img alt="" src="https://assets.leetcode.com/uploads/2019/06/11/screen-shot-2019-06-11-at-83301-pm.png" style="width: 250px; height: 199px;" />
<pre>
输入：root = [1,2,-3,-5,null,4,null], limit = -1
输出：[1,null,-3,4]
</pre>

&nbsp;

提示：

<ul>
	<li>树中节点数目在范围 <code>[1, 5000]</code> 内</li>
	<li><code>-105 &lt;= Node.val &lt;= 105</code></li>
	<li><code>-109 &lt;= limit &lt;= 109</code></li>
</ul>

&nbsp;