Minimum Absolute Difference in BST
Easy
Topics
Given the root of a Binary Search Tree, return the minimum absolute difference between the values of any two different nodes.
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
- 2 <= number of nodes <= 10^4
- 0 <= Node.val <= 10^5
- The tree is a valid BST.
Run ⌘' · Submit ⌘⏎
SensAI