Leetcode 530. Minimum Absolute Difference in BST

class Solution {
public:
    int getMinimumDifference(TreeNode* root) {
        vector<int> tem;
        dfs(root,tem);
        int ans;
        int len = tem.size();
        ans = abs(tem[1]-tem[0]);
        for(int i=2;i<len;i++)
            ans = min(ans,abs(tem[i]-tem[i-1]));
        return ans;
    }
    
    void dfs(TreeNode* root,vector<int> &tem){
        if(!root)
            return;
        dfs(root->left,tem);
        tem.push_back(root->val);
        dfs(root->right,tem);
    }
};