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