fix white space formatting errors

Author: skamble2

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

@@ -35,8 +35,12 @@ BTreeNode search(int key) {
             while (i < n && key > keys[i]) {
                 i++;
             }
-            if (i < n && keys[i] == key) {return this;}
-            if (leaf) {return null;}
+            if (i < n && keys[i] == key) {
+                return this;
+            }
+            if (leaf) {
+                return null;
+            }
             return children[i].search(key);
         }
 
@@ -114,7 +118,9 @@ void remove(int key) {
 
         private int findKey(int key) {
             int idx = 0;
-            while (idx < n && keys[idx] < key) {++idx;}
+            while (idx < n && keys[idx] < key) {
+                ++idx;
+            }
             return idx;
         }
 
@@ -261,7 +267,9 @@ public BTree(int t) {
     }
 
     public void traverse(ArrayList<Integer> result) {
-        if (root != null) {root.traverse(result);}
+        if (root != null) {
+            root.traverse(result);
+        }
     }
 
     public boolean search(int key) {
@@ -279,7 +287,9 @@ public void insert(int key) {
                 s.children[0] = root;
                 s.splitChild(0, root);
                 int i = 0;
-                if (s.keys[0] < key) {i++;}
+                if (s.keys[0] < key) {
+                    i++;
+                }
                 s.children[i].insertNonFull(key);
                 root = s;
             } else {
@@ -289,7 +299,9 @@ public void insert(int key) {
     }
 
     public void delete(int key) {
-        if (root == null) {return;}
+        if (root == null) {
+            return;
+        }
         root.remove(key);
         if (root.n == 0) {
             root = root.leaf ? null : root.children[0];