leetcode——530. 二叉搜索树的最小绝对差

class Solution {
public:
vectorvec;
    void traversal(TreeNode* root)
    {
        if(root==nullptr) return;
        traversal(root->left);
        vec.push_back(root->val);
        traversal(root->right);
    }
    int getMinimumDifference(TreeNode* root) {
        traversal(root);
        int mindif=abs(vec[1]-vec[0]);
        for(int i=2;iabs(vec[i]-vec[i-1]))
            {mindif=abs(vec[i]-vec[i-1]);}
        }
        return mindif;
    }
};