Class Solution
- java.lang.Object
-
- g0501_0600.s0530_minimum_absolute_difference_in_bst.Solution
-
public class Solution extends Object
530 - Minimum Absolute Difference in BST.Easy
Given the
root
of a Binary Search Tree (BST), return the minimum absolute 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, 104]
. 0 <= Node.val <= 105
Note: This question is the same as 783: https://leetcode.com/problems/minimum-distance-between-bst-nodes/
- The number of nodes in the tree is in the range
-
-
Constructor Summary
Constructors Constructor Description Solution()
-
-
-
Method Detail
-
getMinimumDifference
public int getMinimumDifference(TreeNode root)
-
-