Create 783. Minimum Distance Between BST Nodes (#95)

783. Minimum Distance Between BST Nodes

Author: Chayandas07

783. Minimum Distance Between BST Nodes

@@ -0,0 +1,34 @@
+/**
+ * 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: vector<int>store;
+
+     void dfs(TreeNode* node){ //dfs traversal
+         if(node==NULL) return;
+         store.push_back(node->val);
+         dfs(node->left);       //left call
+         dfs(node->right);      //right call
+      } 
+
+
+    int minDiffInBST(TreeNode* root) {
+        dfs(root);             //function calling
+        sort(store.begin(),store.end());
+        int result=INT_MAX;  
+        for(int i=0;i+1<store.size();++i){  //finding two no such that their differnce is minimum
+             if(store[i+1]-store[i]<result){
+                result=store[i+1]-store[i];
+             }
+        }
+        return result;;
+    }
+};