Minimum Distance Between BST Nodes
Given the root of a Binary Search Tree (BST), return the minimum difference between the values of any two different nodes in the tree.
Note: This question is the same as 530: https://leetcode.com/problems/minimum-absolute-difference-in-bst/
Example 1
4
/ \
2 6
/ \
1 3Input
root = [4,2,6,1,3]Output
1The closest pair of node values differs by 1, such as 1 and 2 or 2 and 3.
Example 2
1
/ \
0 48
/ \
12 49Input
root = [1,0,48,null,null,12,49]Output
1The closest pair of node values differs by 1, such as 0 and 1 or 48 and 49.
Constraints
- The number of nodes in the tree is in the range [2, 100].
- 0 <= Node.val <= 10^5