2022-05-21 update: updated links

Author: fartem

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/ConstructBinarySearchTreeFromPreorderTraversal.java

@@ -2,7 +2,7 @@
 
 import com.smlnskgmail.jaman.leetcodejava.support.TreeNode;
 
-// https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal
+// https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/
 public class ConstructBinarySearchTreeFromPreorderTraversal {
 
     private final int[] input;
@@ -15,11 +15,7 @@ public TreeNode solution() {
         return constructBST(input, 0, input.length - 1);
     }
 
-    private TreeNode constructBST(
-            int[] preorder,
-            int start,
-            int end
-    ) {
+    private TreeNode constructBST(int[] preorder, int start, int end) {
         if (start > end) {
             return null;
         }

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/ConvertBSToGreaterTree.java

@@ -2,7 +2,7 @@
 
 import com.smlnskgmail.jaman.leetcodejava.support.TreeNode;
 
-// https://leetcode.com/problems/convert-bst-to-greater-tree
+// https://leetcode.com/problems/convert-bst-to-greater-tree/
 public class ConvertBSToGreaterTree {
 
     private final TreeNode input;