refactor 530

fishercoder1534 · fishercoder1534 · commit 7e18edf47690 · 2020-07-15T09:16:42.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_530.java b/src/main/java/com/fishercoder/solutions/_530.java
@@ -5,28 +5,6 @@
 import java.util.Iterator;
 import java.util.TreeSet;
 
-/**
- * 530. Minimum Absolute Difference in BST
- *
- * Given a binary search tree with non-negative values, find the minimum absolute difference between values of any two nodes.
-
- Example:
-
- Input:
-
-  1
-   \
-   3
-  /
- 2
-
- Output:
- 1
-
- Explanation:
- The minimum absolute difference is 1, which is the difference between 2 and 1 (or between 2 and 3).
- Note: There are at least two nodes in this BST.
- */
 public class _530 {
 
     public static class Solution1 {
