style: enable RedundantModifier in checkstyle (#5140)

src/main/java/com/thealgorithms/datastructures/trees/BinaryTree.java

@@ -47,7 +47,7 @@ public class BinaryTree {
          *
          * @param value Value to put in the node
          */
-        public Node(int value) {
+        Node(int value) {
             data = value;
             left = null;
             right = null;

src/main/java/com/thealgorithms/datastructures/trees/KDTree.java

@@ -68,7 +68,7 @@ public class KDTree {
             return coordinates.length;
         }
 
-        public Point(int[] coordinates) {
+        Point(int[] coordinates) {
             this.coordinates = coordinates;
         }
 

src/main/java/com/thealgorithms/datastructures/trees/LazySegmentTree.java

@@ -15,7 +15,7 @@ public class LazySegmentTree {
         private int lazy; // lazied value that should be added to children nodes
         Node left, right; // left and right children
 
-        public Node(int start, int end, int value) {
+        Node(int start, int end, int value) {
             this.start = start;
             this.end = end;
             this.value = value;

src/main/java/com/thealgorithms/datastructures/trees/PrintTopViewofTree.java

@@ -13,7 +13,7 @@ class TreeNode {
     TreeNode left, right;
 
     // Constructor
-    public TreeNode(int key) {
+    TreeNode(int key) {
         this.key = key;
         left = right = null;
     }
@@ -27,7 +27,7 @@ class QItem {
     TreeNode node;
     int hd;
 
-    public QItem(TreeNode n, int h) {
+    QItem(TreeNode n, int h) {
         node = n;
         hd = h;
     }
@@ -39,11 +39,11 @@ class Tree {
     TreeNode root;
 
     // Constructors
-    public Tree() {
+    Tree() {
         root = null;
     }
 
-    public Tree(TreeNode n) {
+    Tree(TreeNode n) {
         root = n;
     }
 

src/main/java/com/thealgorithms/datastructures/trees/nearestRightKey.java

@@ -53,13 +53,13 @@ class NRKTree {
     public NRKTree right;
     public int data;
 
-    public NRKTree(int x) {
+    NRKTree(int x) {
         this.left = null;
         this.right = null;
         this.data = x;
     }
 
-    public NRKTree(NRKTree right, NRKTree left, int x) {
+    NRKTree(NRKTree right, NRKTree left, int x) {
         this.left = left;
         this.right = right;
         this.data = x;