C++ | Leetcode C++题解之第530题二叉搜索树的最小绝对差

题目：

题解：

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