/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
vector<int>a;
void order(TreeNode *t){
if(t==NULL)return;
else{
order(t->left);
a.push_back(t->val);
order(t->right);
}
}
int getMinimumDifference(TreeNode* root) {
order(root);
if(root==NULL)return 0;
if(a.size()==1)return a[0];
int m=abs(a[a.size()-1]);
for(int i=0;i<a.size()-1;i++){
if(abs(a[i]-a[i+1])<m)m=abs(a[i]-a[i+1]);
}
return m;
}
};
530. 二叉搜索树的最小绝对差
最新推荐文章于 2024-09-13 16:27:15 发布