Leetcode/Minimum_Distance_Between_BST_Nodes.cpp at main · sazzadkhan20/Leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution
{
public:
    void inorder(TreeNode *root, vector<int> &v)
    {
        if (!root)
            return;
        inorder(root->left, v);
        v.push_back(root->val);
        inorder(root->right, v);
    }
    int minDiffInBST(TreeNode *root)
    {
        vector<int> v;
        inorder(root, v);
        int minimum = INT_MAX;
        for (int i = 0; i < v.size() - 1; i++)
        {
            int val = abs(v[i] - v[i + 1]);
            minimum = min(val, minimum);
        }
        return minimum;
    }
};