530. Minimum Absolute Difference in BST 530. BST的最小绝对差

Given a binary search tree with non-negative values, find the minimum absolute difference between values of any two nodes.

Example:

Input:

   1
    \
     3
    /
   2

Output:
1

Explanation:
The minimum absolute difference is 1, which is the difference between 2 and 1 (or between 2 and 3).

标签：BST,530,minimum,Minimum,values,between,difference,absolute
来源： https://www.cnblogs.com/immiao0319/p/12945951.html