力扣-530题 二叉搜索树的最小绝对差（C++）- dfs

题目链接：https://leetcode-cn.com/problems/minimum-absolute-difference-in-bst/
题目如下：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    int getMinimumDifference(TreeNode* root) {
        dfs(root);
        return res;
    }
    void dfs(TreeNode* root){
        if(!root) return;

        dfs(root->left);
        
        //下面几行需要特别记忆了解下
        if(pre){
            res=min(res,abs(pre->val - root->val));
        }
        pre=root;

        dfs(root->right);
    }
private:
    int res=INT_MAX;
    TreeNode* pre=nullptr;
};