ref: update tests

Author: sozelfist

src/test/java/com/thealgorithms/datastructures/trees/SplayTreeTest.java

@@ -1,6 +1,8 @@
 package com.thealgorithms.datastructures.trees;
 
-import static org.junit.jupiter.api.Assertions.*;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 import java.util.Arrays;
 import java.util.LinkedList;
@@ -12,12 +14,12 @@
 public class SplayTreeTest {
     @ParameterizedTest
     @MethodSource("traversalOrders")
-    public void testTraversal(String traversalOrder) {
+    public void testTraversal(SplayTree.TraverseOrder traverseOrder) {
         SplayTree tree = createComplexTree();
 
         // Perform traversal based on the provided order and verify the result
-        List<Integer> expected = getExpectedTraversalResult(traversalOrder);
-        List<Integer> result = performTraversal(tree, traversalOrder);
+        List<Integer> expected = getExpectedTraversalResult(traverseOrder);
+        List<Integer> result = tree.traverse(traverseOrder);
         assertEquals(expected, result);
     }
 
@@ -42,44 +44,30 @@ public void testDelete(int value) {
     }
 
     // Method to provide different traversal orders as parameters
-    private static Stream<String> traversalOrders() {
-        return Stream.of("inOrder", "preOrder", "postOrder");
+    private static Stream<SplayTree.TraverseOrder> traversalOrders() {
+        return Stream.of(SplayTree.TraverseOrder.IN_ORDER, SplayTree.TraverseOrder.PRE_ORDER, SplayTree.TraverseOrder.POST_ORDER);
     }
 
     // Method to provide values for search and delete tests as parameters
     private static Stream<Integer> valuesToTest() {
         return Stream.of(1, 5, 10); // Values present in the complex tree
     }
 
-    // Method to perform traversal based on the provided order
-    private List<Integer> performTraversal(SplayTree tree, String traversalOrder) {
-        switch (traversalOrder) {
-        case "inOrder":
-            return tree.inOrder();
-        case "preOrder":
-            return tree.preOrder();
-        case "postOrder":
-            return tree.postOrder();
-        default:
-            throw new IllegalArgumentException("Invalid traversal order: " + traversalOrder);
-        }
-    }
-
     // Method to get the expected traversal result based on the provided order
-    private List<Integer> getExpectedTraversalResult(String traversalOrder) {
+    private List<Integer> getExpectedTraversalResult(SplayTree.TraverseOrder traverseOrder) {
         List<Integer> expected = new LinkedList<>();
-        switch (traversalOrder) {
-        case "inOrder":
+        switch (traverseOrder) {
+        case IN_ORDER:
             expected.addAll(Arrays.asList(1, 2, 3, 4, 5, 6, 7, 8, 9, 10));
             break;
-        case "preOrder":
+        case PRE_ORDER:
             expected.addAll(Arrays.asList(10, 9, 8, 7, 3, 1, 2, 5, 4, 6));
             break;
-        case "postOrder":
+        case POST_ORDER:
             expected.addAll(Arrays.asList(2, 1, 4, 6, 5, 3, 7, 8, 9, 10));
             break;
         default:
-            throw new IllegalArgumentException("Invalid traversal order: " + traversalOrder);
+            throw new IllegalArgumentException("Invalid traversal order: " + traverseOrder);
         }
         return expected;
     }