题解 | #牛群最小体重差#

/**
 * struct TreeNode {
 *	int val;
 *	struct TreeNode *left;
 *	struct TreeNode *right;
 *	TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 * };
 */
class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param root TreeNode类 
     * @return int整型
     */
    void inorder(TreeNode* root, vector<int>& v)
    {
        if (root == nullptr)
            return;
        inorder(root->left, v);
        v.push_back(root->val);
        inorder(root->right, v);
    }
    int getMinimumDifference(TreeNode* root) {
        // write code here
        vector<int> v;
        inorder(root, v);
        int ret = INT_MAX;
        for (int i = 1; i < v.size(); i += 2)
            ret = min(ret, v[i] - v[i - 1]);
        return ret;
    }
};