min dist between bst nodes

Author: eizadhamdan

Easy/783-minimum_distance_between_bst_nodes.cpp

@@ -0,0 +1,49 @@
+/**
+ * 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 minDiffInBST(TreeNode *root)
+    {
+        prev = nullptr;
+        minDiff = INT_MAX;
+        inOrderTraversal(root);
+        return minDiff;
+    }
+
+private:
+    TreeNode *prev;
+    int minDiff;
+
+    void inOrderTraversal(TreeNode *node)
+    {
+        if (node == nullptr)
+        {
+            return;
+        }
+
+        // Traverse left subtree
+        inOrderTraversal(node->left);
+
+        // Compute the minimum difference
+        if (prev != nullptr)
+        {
+            minDiff = std::min(minDiff, node->val - prev->val);
+        }
+
+        // Update previous node
+        prev = node;
+
+        // Traverse right subtree
+        inOrderTraversal(node->right);
+    }
+};