range-sum-of-bst

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> node of a binary search tree and two integers <code>low</code> and <code>high</code>, return the sum of values of all nodes with a value in the inclusive range <code>[low, high]</code>.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2020/11/05/bst1.jpg" style="width: 400px; height: 222px;" />
<pre>
Input: root = [10,5,15,3,7,null,18], low = 7, high = 15
Output: 32
Explanation: Nodes 7, 10, and 15 are in the range [7, 15]. 7 + 10 + 15 = 32.
</pre>

Example 2:
<img alt="" src="https://assets.leetcode.com/uploads/2020/11/05/bst2.jpg" style="width: 400px; height: 335px;" />
<pre>
Input: root = [10,5,15,3,7,13,18,1,null,6], low = 6, high = 10
Output: 23
Explanation: Nodes 6, 7, and 10 are in the range [6, 10]. 6 + 7 + 10 = 23.
</pre>

&nbsp;
Constraints:

<ul>
	<li>The number of nodes in the tree is in the range <code>[1, 2 * 104]</code>.</li>
	<li><code>1 &lt;= Node.val &lt;= 105</code></li>
	<li><code>1 &lt;= low &lt;= high &lt;= 105</code></li>
	<li>All <code>Node.val</code> are unique.</li>
</ul>

rangeSumBST

Range Sum of BST

Tree

Depth-First Search

Binary Search Tree

Binary Tree

给定二叉搜索树的根结点 <code>root</code>，返回值位于范围 <code>[low, high]</code> 之间的所有结点的值的和。

 

示例 1：
<img alt="" src="https://assets.leetcode.com/uploads/2020/11/05/bst1.jpg" style="width: 400px; height: 222px;" />
<pre>
输入：root = [10,5,15,3,7,null,18], low = 7, high = 15
输出：32
</pre>

示例 2：
<img alt="" src="https://assets.leetcode.com/uploads/2020/11/05/bst2.jpg" style="width: 400px; height: 335px;" />
<pre>
输入：root = [10,5,15,3,7,13,18,1,null,6], low = 6, high = 10
输出：23
</pre>

 

提示：

<ul>
	<li>树中节点数目在范围 <code>[1, 2 * 104]</code> 内</li>
	<li><code>1 <= Node.val <= 105</code></li>
	<li><code>1 <= low <= high <= 105</code></li>
	<li>所有 <code>Node.val</code> 互不相同</li>
</ul>