29 lines
1.1 KiB
Markdown
29 lines
1.1 KiB
Markdown
|
<p>给定二叉搜索树的根结点 <code>root</code>，返回值位于范围 <em><code>[low, high]</code></em> 之间的所有结点的值的和。</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1：</strong></p>
|
|||
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2020/11/05/bst1.jpg" style="width: 400px; height: 222px;" />
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>root = [10,5,15,3,7,null,18], low = 7, high = 15
|
|||
|
|
<strong>输出：</strong>32
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2：</strong></p>
|
|||
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2020/11/05/bst2.jpg" style="width: 400px; height: 335px;" />
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>root = [10,5,15,3,7,13,18,1,null,6], low = 6, high = 10
|
|||
|
|
<strong>输出：</strong>23
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li>树中节点数目在范围 <code>[1, 2 * 10<sup>4</sup>]</code> 内</li>
|
|||
|
|
<li><code>1 <= Node.val <= 10<sup>5</sup></code></li>
|
|||
|
|
<li><code>1 <= low <= high <= 10<sup>5</sup></code></li>
|
|||
|
|
<li>所有 <code>Node.val</code> <strong>互不相同</strong></li>
|
|||
|
|
</ul>
|
|||
|
|
<div><div>Related Topics</div><div><li>树</li><li>深度优先搜索</li><li>递归</li></div></div>\n<div><li>👍 189</li><li>👎 0</li></div>
|