題目來源
求二叉搜索樹的任意兩個節(jié)點間的最小的差值惊奇，注意利用其性質(zhì)，中序遍歷就是一個遞增序列颂郎，然后計算前后兩個節(jié)點的差值就可以了，代碼如下：
/**
* 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 last = -1, minimum = INT_MAX;
if (root == NULL)
return 0;
dfs(root, last, minimum);
return minimum;
}
void dfs(TreeNode *node, int &last, int &minimum)
{
if (node->left)
dfs(node->left, last, minimum);
if (last >= 0)
minimum = min(minimum, abs(node->val-last));
last = node->val;
if (node->right)
dfs(node->right, last, minimum);
}
};
