如图 找出二叉搜索树的节点最小差值,二叉搜索树是排序树,所以最小差值必然在根节点和对应的子节点之间,所以简单的中序遍历即可
双指针法:
class Solution {
private:
int mindiff=INT_MAX;
int pre=-1,cur=-1;
public:
int minDiffInBST(TreeNode* root) {
if(!root) return 0;
minDiffInBST(root->left);
pre=cur;
cur=root->val;
if(pre==-1)mindiff=INT_MAX;
else mindiff=min(mindiff,cur-pre);
minDiffInBST(root->right);
return mindiff;
}
};
数组法
class Solution {
private:
int mindiff=INT_MAX;
vector<int> res;
public:
int minDiffInBST(TreeNode* root) {
cunzhi(root);
for(int i=1;i<res.size();i++){
mindiff=min(mindiff,res[i]-res[i-1]);
}
return mindiff;
}
void cunzhi(TreeNode* root){
if(!root)return ;
minDiffInBST(root->left);
res.push_back(root->val);
minDiffInBST(root->right);
}
};