[leetcode]Minimum Absolute Difference in BST
链接:https://leetcode.com/problems/minimum-absolute-difference-in-bst/description/
Question
Given a binary search tree with non-negative values, find the minimum absolute difference between values of any two nodes.
Example
Input:
1
\
3
/
2
Output:
1
Explanation:
The minimum absolute difference is 1, which is the difference between 2 and 1 (or between 2 and 3).
Solution
// 技巧:排序二叉树的中序排列的结果是单调递增的序列
// 将排序二叉树的递增序列找到之后,比较相邻的差值取差值最小的就可以了
/**
* 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:
#define inf 0x3fffffff
vector<int> vec;
void inOrder(TreeNode* root) {
if (root == NULL) return;
inOrder(root->left);
vec.push_back(root->val);
inOrder(root->right);
}
int getMinimumDifference(TreeNode* root) {
inOrder(root);
int min_val = inf;
for (int i = 0; i < vec.size()-1; i++)
min_val = (vec[i+1] - vec[i] < min_val)? vec[i+1] - vec[i]: min_val;
return min_val;
}
};
思路:将排序二叉树的递增序列找到之后,比较相邻的差值取差值最小的就可以了。