LeetCode 530 — Minimum Absolute Difference in BST (Java Solution Explained)
📌 Problem Recap
We are given the root of a Binary Search Tree (BST).Goal → return the minimum absolute difference between values of any two different nodes.
Constraints:
2 ≤ n ≤ 10^4
0 ≤ val ≤ 10^5
Example:
Input: root = [4,2,6,1,3]
Output: 1
...
leetlog-by-chao.hashnode.dev2 min read