Create 530. Minimum Absolute Difference in BST

Author: khushi3004

530. Minimum Absolute Difference in BST

@@ -0,0 +1,40 @@
+/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ *     int val;
+ *     TreeNode left;
+ *     TreeNode right;
+ *     TreeNode() {}
+ *     TreeNode(int val) { this.val = val; }
+ *     TreeNode(int val, TreeNode left, TreeNode right) {
+ *         this.val = val;
+ *         this.left = left;
+ *         this.right = right;
+ *     }
+ * }
+ */
+class Solution {
+    int minDifference = Integer.MAX_VALUE;
+    Integer prev = null;
+    public int getMinimumDifference(TreeNode root) {
+        
+        //Exit Condition
+        if(root == null) return minDifference;
+
+        getMinimumDifference(root.left);
+
+        //Process Root
+        if(prev != null){
+            minDifference = Math.min(minDifference, root.val-prev);
+        }
+
+        if(root != null){
+            prev = root.val;
+        }
+
+        getMinimumDifference(root.right);
+
+        return minDifference;
+    }
+}
+