Minimum Absolute Difference in BST
You are given the root of a binary tree. Return the smallest absolute difference between the values of any two different nodes of the BST. The tree has at least two nodes, and values are distinct. In a binary search tree every value in a left subtree is smaller than its node and every value in a right subtree is larger.
Trees appear in the tests in level order, with null for a missing child, like [3,9,20,null,null,15,7]. Each node is a TreeNode with .val, .left and .right; the class is already defined for you.
Example 1
root [4,2,6,1,3]
returns 1
1 and 2 (or 2 and 3, or 3 and 4) differ by 1.
Constraints
2 <= number of nodes <= 100-1000 <= node.val <= 1000- The tree is a valid BST with distinct values.
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.