Solution (leetcode-in-java 1.19 API)

java.lang.Object
- g0701_0800.s0783_minimum_distance_between_bst_nodes.Solution

```
public class Solution
extends Object
```
783 - Minimum Distance Between BST Nodes.
Easy

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:

Input: root = [4,2,6,1,3]

Output: 1

Example 2:

Input: root = [1,0,48,null,null,12,49]

Output: 1

Constraints:
- The number of nodes in the tree is in the range [2, 100].
- 0 <= Node.val <= 10⁵
Note: This question is the same as 530: https://leetcode.com/problems/minimum-absolute-difference-in-bst/

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  int minDiffInBST(TreeNode root)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

minDiffInBST

public int minDiffInBST(TreeNode root)