292. Minimum Absolute Difference in BST

Given the root of a Binary Search Tree represented as a level-order array, return the minimum absolute difference between the values of any two different nodes in the tree.

Example:
Input: root = [4,2,6,1,3]
Output: 1

Run this challenge interactively in Python or JavaScript when the app loads.