2021-03-11

二叉树中序遍历记录前一个节点的指针

530.⼆叉搜索树的最⼩绝对差
题⽬地址：https://leetcode-cn.com/problems/minimum-absolute-difference-in-bst/

---

二叉搜索树的中序遍历是有序的，利用这一特性来解题

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    TreeNode pre;
    int result = Integer.MAX_VALUE;
    public int getMinimumDifference(TreeNode root) {
        process(root);
        return result;
    }

    public void process(TreeNode root){
        if(root == null){
            return;
        }
        //中序遍历 pre指针指向前一个节点
        process(root.left);
        if(pre != null){
            result = Math.min(result, root.val - pre.val);
        }
        pre = root;
        process(root.right);
    }
}