Preparing this workspace.
Minimum Absolute Difference in BST
Difficulty: Easy
Category: DSA
Topics: Tree, Depth-First Search, Breadth-First Search, Binary Search Tree, Binary Tree
Asked at: Google
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/
Opening the problem
Progress is saved as you study.