30 lines
880 B
Markdown
30 lines
880 B
Markdown
|
<p>给你一棵所有节点为非负值的二叉搜索树，请你计算树中任意两节点的差的绝对值的最小值。</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例：</strong></p>
|
|||
|
|
|
|||
|
|
<pre><strong>输入：</strong>
|
|||
|
|
|
|||
|
|
1
|
|||
|
|
\
|
|||
|
|
3
|
|||
|
|
/
|
|||
|
|
2
|
|||
|
|
|
|||
|
|
<strong>输出：</strong>
|
|||
|
|
1
|
|||
|
|
|
|||
|
|
<strong>解释：
|
|||
|
|
</strong>最小绝对差为 1，其中 2 和 1 的差的绝对值为 1（或者 2 和 3）。
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li>树中至少有 2 个节点。</li>
|
|||
|
|
<li>本题与 783 <a href="https://leetcode-cn.com/problems/minimum-distance-between-bst-nodes/">https://leetcode-cn.com/problems/minimum-distance-between-bst-nodes/</a> 相同</li>
|
|||
|
|
</ul>
|
|||
|
|
<div><div>Related Topics</div><div><li>树</li><li>深度优先搜索</li><li>广度优先搜索</li><li>二叉搜索树</li><li>二叉树</li></div></div>\n<div><li>👍 264</li><li>👎 0</li></div>
|