minimum-absolute-difference-in-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> of a Binary Search Tree (BST), return the minimum absolute difference between the values of any two different nodes in the tree.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2021/02/05/bst1.jpg" style="width: 292px; height: 301px;" />
<pre>
Input: root = [4,2,6,1,3]
Output: 1
</pre>

Example 2:
<img alt="" src="https://assets.leetcode.com/uploads/2021/02/05/bst2.jpg" style="width: 282px; height: 301px;" />
<pre>
Input: root = [1,0,48,null,null,12,49]
Output: 1
</pre>

&nbsp;
Constraints:

<ul>
	<li>The number of nodes in the tree is in the range <code>[2, 104]</code>.</li>
	<li><code>0 &lt;= Node.val &lt;= 105</code></li>
</ul>

&nbsp;
Note: This question is the same as 783: <a href="https://leetcode.com/problems/minimum-distance-between-bst-nodes/" target="_blank">https://leetcode.com/problems/minimum-distance-between-bst-nodes/</a>

getMinimumDifference

Minimum Absolute Difference in BST

K-diff Pairs in an Array

k-diff-pairs-in-an-array

数组中的 k-diff 数对

Tree

Depth-First Search

Breadth-First Search

Binary Search Tree

Binary Tree

给你一个二叉搜索树的根节点 <code>root</code> ，返回 树中任意两不同节点值之间的最小差值 。

差值是一个正数，其数值等于两值之差的绝对值。

&nbsp;

示例 1：
<img alt="" src="https://assets.leetcode.com/uploads/2021/02/05/bst1.jpg" style="width: 292px; height: 301px;" />
<pre>
输入：root = [4,2,6,1,3]
输出：1
</pre>

示例 2：
<img alt="" src="https://assets.leetcode.com/uploads/2021/02/05/bst2.jpg" style="width: 282px; height: 301px;" />
<pre>
输入：root = [1,0,48,null,null,12,49]
输出：1
</pre>

&nbsp;

提示：

<ul>
	<li>树中节点的数目范围是 <code>[2, 104]</code></li>
	<li><code>0 &lt;= Node.val &lt;= 105</code></li>
</ul>

&nbsp;

注意：本题与 783 <a href="https://leetcode-cn.com/problems/minimum-distance-between-bst-nodes/">https://leetcode-cn.com/problems/minimum-distance-between-bst-nodes/</a> 相同