<p>Given the <code>root</code> of a Binary Search Tree (BST), return <em>the minimum absolute difference between the values of any two different nodes in the tree</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/02/05/bst1.jpg" style="width: 292px; height: 301px;" />
<pre>
<strong>Input:</strong> root = [4,2,6,1,3]
<strong>Output:</strong> 1
</pre>

<p><strong class="example">Example 2:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/02/05/bst2.jpg" style="width: 282px; height: 301px;" />
<pre>
<strong>Input:</strong> root = [1,0,48,null,null,12,49]
<strong>Output:</strong> 1
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li>The number of nodes in the tree is in the range <code>[2, 10<sup>4</sup>]</code>.</li>
	<li><code>0 &lt;= Node.val &lt;= 10<sup>5</sup></code></li>
</ul>

<p>&nbsp;</p>
<p><strong>Note:</strong> This question is the same as 783: <a href="https://leetcode.com/problems/minimum-distance-between-bst-nodes/" target="_blank">https://leetcode.com/problems/minimum-distance-between-bst-nodes/</a></p>

/**
 * 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:
    int getMinimumDifference(TreeNode* root) {
        if(root==nullptr)
        return 0;
        TreeNode* temp = nullptr;
        TreeNode* prev = nullptr;
        TreeNode* cur = root;
        int minabs=INT_MAX;
        vector<int> nums;
        while(cur)
        {
            if(cur->left!=nullptr)
            {
                prev = cur->left;
                while(prev!= nullptr &&prev->right!=nullptr)
                {
                    prev = prev->right;
                }
                prev->right = cur;
                temp = cur;
                cur = cur->left;
                temp->left = nullptr;
            }
            else
            {
                // if(cur!= nullptr && cur->right!=nullptr)
                // {
                //     minabs = min(minabs, abs(cur->val - cur->right->val));
                // }
                nums.push_back(cur->val);
                cur = cur->right;
            }
        }

        for(ptrdiff_t i =0; i < nums.size()-1;i++)
        {
               minabs = min(minabs, abs(nums[i]- nums[i+1]));
        }


        return minabs;

    }
};
18200