题目链接:点击这里
若按中序遍历一棵二叉排序树,所得到的结点序列是一个递增序列。
/**
* 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:
void inorder(TreeNode* r, vector<int> &a)
{
if(r!=NULL)
{
inorder(r->left, a);
a.push_back(r->val);
inorder(r->right, a);
}
}
int minDiffInBST(TreeNode* root) {
vector<int> a;
inorder(root, a);
int ans = INT_MAX;
for(int i = 1; i < a.size(); i++)
ans = min(ans, a[i]-a[i-1]);
return ans;
}
};