题目:
https://leetcode.cn/problems/minimum-absolute-difference-in-bst/description/
https://leetcode.cn/problems/minimum-distance-between-bst-nodes/description/
给你一个二叉搜索树的根节点 root ,返回 树中任意两不同节点值之间的最小差值 。
差值是一个正数,其数值等于两值之差的绝对值。
示例:
输入:root = [4,2,6,1,3]
输出:1
代码:
/**
* 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:
void traverse(TreeNode* node, TreeNode*& preNode, int& res) {
if (node == nullptr) {
return;
}
traverse(node->left, preNode, res);
if (preNode == nullptr) {
preNode = node;
} else {
res = min(res, node->val - preNode->val);
preNode = node;
}
traverse(node->right, preNode, res);
}
// 二叉搜索树的中序遍历
int getMinimumDifference(TreeNode* root) {
int res = INT_MAX;
TreeNode* preNode = nullptr;
traverse(root, preNode, res);
return res;
}
};