edit 98

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_98.java

@@ -3,6 +3,8 @@
 import com.fishercoder.common.classes.TreeNode;
 
 /**
+ * 98. Validate Binary Search Tree
+ *
  * Given a binary tree, determine if it is a valid binary search tree (BST).
 
  Assume a BST is defined as follows:
@@ -52,4 +54,8 @@ private boolean dfs(TreeNode root, long minValue, long maxValue) {
         if (root.right != null) rightResult = dfs(root.right, root.val, maxValue);
         return leftResult && rightResult;
     }
+
+    public static void main(String... args) {
+        System.out.println(Integer.MAX_VALUE == 2147483647);
+    }
 }