给你一个二叉搜索树的根节点 root
,返回 树中任意两不同节点值之间的最小差值 。
注意:本题与 530:https://leetcode-cn.com/problems/minimum-absolute-difference-in-bst/ 相同
示例 1:
输入:root = [4,2,6,1,3]
输出:1
示例 2:
输入:root = [1,0,48,null,null,12,49]
输出:1
提示:
- 树中节点数目在范围
[2, 100]
内 0 <= Node.val <= 10^5
解答
由于时二叉搜索树,所以中序遍历为有序排列,显然节点间最小差值一定发生在相邻节点:
/**
* 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 minDiffInBST(TreeNode* root) {
TreeNode* pre = nullptr;
int result = INT_MAX;
helper(root, pre, result);
return result;
}
void helper(TreeNode* cur, TreeNode*& pre, int& result){
if(!cur)
return;
helper(cur->left, pre, result);
if(pre){
result = min(result, cur->val - pre->val);
}
pre = cur;
helper(cur->right, pre, result);
}
};