Easy

Quiz

#530 Minimum Absolute Difference in BST

APPROACH

Given the root of a Binary Search Tree (BST), compute and return the smallest absolute difference between the values of any two distinct 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

1 of 4

1:00

What is the optimal approach for this problem?