give root Binary Search Tree BST return minimum absolute difference value different node tree example 1input root 42613output 1example 2input root 1048nullnull1249output 1 ConstraintsThe number nod tree range 2 1040 Nodeval 105 note this question 783 httpsleetcodecomproblemsminimumdistancebetweenbstnode