leetcode530+二叉树中最小差值，中序查找最小差值

https://leetcode.com/problems/minimum-absolute-difference-in-bst/description/

struct TreeNode {
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

class Solution {
public:
    void inorder(TreeNode* root, int& pre, int& res)
    {
        if(!root) return;
        inorder(root->left, pre, res);
        if(pre!=-1) res = min(res, root->val - pre);
        pre = root->val;
        inorder(root->right, pre, res);
    }
    int getMinimumDifference(TreeNode* root) {
        int res = INT_MAX, pre = -1;
        inorder(root, pre, res);
        return res;
    }
};