LeetCode530.二叉搜索树的最小绝对差

class Solution {
public:
    int minDiff(vector<int> inorder)
    {
        int min = abs(inorder[0] - inorder[1]);
        for (int i = 1; i < inorder.size() - 1; i++)
        {
            if (abs(inorder[i] - inorder[i + 1]) < min)
                min = abs(inorder[i] - inorder[i + 1]);
        }
        return min;
    }
    void inTraversal(TreeNode* root, vector<int>& inorder)
    {
        if (root == nullptr) return;
        else
        {
            inTraversal(root->left, inorder);
            inorder.push_back(root->val);
            inTraversal(root->right, inorder);
        }
    }
    int getMinimumDifference(TreeNode* root) 
    {
        vector<int> inorder;
        inTraversal(root, inorder);
        return minDiff(inorder);
    }
};