chore: reorganize code structure

Author: sozelfist

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

@@ -86,6 +86,19 @@ public void delete(final int key) {
             root.right = temp.right;
         }
     }
+
+    /**
+     * Perform a traversal of the SplayTree.
+     *
+     * @param traversal The type of traversal method.
+     * @return A list containing the keys in the specified traversal order.
+     */
+    public List<Integer> traverse(TreeTraversal traversal) {
+        List<Integer> result = new LinkedList<>();
+        traversal.traverse(root, result);
+        return result;
+    }
+
     /**
      * Finds the node with the maximum key in a given subtree.
      *
@@ -104,18 +117,6 @@ private Node findMax(Node root) {
         return root;
     }
 
-    /**
-     * Perform a traversal of the SplayTree.
-     *
-     * @param traversal The type of traversal method.
-     * @return A list containing the keys in the specified traversal order.
-     */
-    public List<Integer> traverse(TreeTraversal traversal) {
-        List<Integer> result = new LinkedList<>();
-        traversal.traverse(root, result);
-        return result;
-    }
-
     /**
      * Zig operation.
      *