LeetCode 530. 二叉搜索树的最小绝对差
原题链接
简单
作者:
大明湖的鱼
,
2021-01-23 08:01:59
,
所有人可见
,
阅读 334
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int getMinimumDifference(TreeNode* root) {
int ans = INT_MAX,pre = -1;
inorder(root,pre,ans);
return ans;
}
void inorder(TreeNode* root, int& pre, int& ans){
if(root == NULL) return ;
inorder(root->left,pre,ans);
if(pre == -1) pre = root->val;
else {
ans = min(ans,root->val - pre);
pre = root->val;
}
inorder(root->right,pre,ans);
}
};
中序遍历为升序序列,不断比较pre和cur就可以