0783. Minimum Distance Between BST Nodes
Last updated
Last updated
https://leetcode.com/problems/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.
Example 1:
Example 2:
Constraints:
The number of nodes in the tree is in the range [2, 100]
.
0 <= Node.val <= 105
Note: This question is the same as 530: https://leetcode.com/problems/minimum-absolute-difference-in-bst/