Skip to content

Files

Latest commit

May 19, 2024
7a5373a · May 19, 2024

History

History
28 lines (18 loc) · 564 Bytes

problem.md

File metadata and controls

28 lines (18 loc) · 564 Bytes

530. Minimum Absolute Difference in BST

Given a binary search tree with non-negative values, find the minimum absolute difference between values of any two nodes.

Example:

Input:

   1
    \
     3
    /
   2

Output:
1

Explanation:
The minimum absolute difference is 1, which is the difference between 2 and 1 (or between 2 and 3).

Note: