Eric 的小站

1
输入：root = [4,2,6,1,3]
2
输出：1

1
输入：root = [1,0,48,null,null,12,49]
2
输出：1

1
/**
2
 * Definition for a binary tree node.
3
 * struct TreeNode {
4
 *     int val;
5
 *     TreeNode *left;
6
 *     TreeNode *right;
7
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
8
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
9
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
10
 * };
11
 */
12
class Solution {
13
    vector<int> vec;
14
public:
15
    int getMinimumDifference(TreeNode* root) {
16
        inOrder(root);
17
        int ans = INT_MAX;
18
        for(int i=1;i<vec.size();i++){
19
            ans = min(ans,vec[i]-vec[i-1]);
20
        }
21
        return ans;
22
    }
23

24
    void inOrder(TreeNode* root) {
25
    if (root == nullptr) return;
26
    inOrder(root->left);
27
    vec.push_back(root->val);
28
    inOrder(root->right);
29

30
}
31
};