updated

Author: Krishnan M

src/main/java/com/thealgorithms/tree/BinarySearchTree.java

@@ -232,9 +232,8 @@ private void display(Node node, String details) {
         if (node == null) {
             return;
         }
-
         System.out.println(details + node.value);
         display(node.left, "Left child of " + node.value + ": ");
         display(node.right, "Right child of " + node.value + ": ");
     }
-}
+}

src/test/java/com/thealgorithms/tree/BinarySearchTree.java

@@ -163,4 +163,4 @@ void testPopulateSorted() {
         sortedBST.populateSorted(sortedValues);
         assertTrue(sortedBST.balanced(), "BST populated with sorted array should be balanced");
     }
-}
+}