LeetCode 530. 二叉搜索树的最小绝对差

LeetCode 530. 二叉搜索树的最小绝对差

给你一棵所有节点为非负值的二叉搜索树，请你计算树中任意两节点的差的绝对值的最小值。

题解：
因为二叉搜索树的中序遍历是递增序列，因此最小的绝对值之差，一定在中序遍历的顺序中相邻，用pre保存中序遍历顺序中，上一节点的数值。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public int getMinimumDifference(TreeNode root) {
        Stack<TreeNode> stack = new Stack<TreeNode>();
        int pre = -1;
        int ans = Integer.MAX_VALUE;
        while(!stack.isEmpty() || root != null){
            while(root != null){
                stack.push(root);
                root = root.left;
            }
            root = stack.pop();
            if(pre !=  -1)
                ans = Math.min(ans,Math.abs(root.val - pre));
            pre = root.val;
            root = root.right;
        }
        return ans;
    }
}

题目来源：
https://leetcode-cn.com/problems/minimum-absolute-difference-in-bst/

题解参考：
https://leetcode-cn.com/problems/minimum-absolute-difference-in-bst/solution/er-cha-sou-suo-shu-de-zui-xiao-jue-dui-chai-by-lee/