0530-minimum-absolute-difference-in-bst.adoc

530. Minimum Absolute Difference in BST

{leetcode}/problems/minimum-absolute-difference-in-bst/[LeetCode - Minimum Absolute Difference in 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).

Note: There are at least two nodes in this BST.

思路分析

看到二叉搜索树，就要想到中序遍历。

link:{sourcedir}/_0530_MinimumAbsoluteDifferenceInBST.java[role=include]

参考资料

1. 530. 二叉搜索树的最小绝对差 - 中序遍历团灭系列二叉搜索树问题