leetcode每日一题第九十九天

class Solution {
public:
    int getMinimumDifference(TreeNode* root) {
        vector<int> v;
        mid(root,v);
        int s = 1000000;
        for(int i = 0;i < v.size()-1;i++)
        {
            s = min(s,v[i+1]-v[i]);
        }
        return s;

    }
    void mid(TreeNode* root,vector<int> &v)
    {
        if(root)
        {
            mid(root->left,v);
            v.push_back(root->val);
            mid(root->right,v);
        }
        else
        {
            return;
        }
    }
};