feat: implement SplayTree

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

@@ -0,0 +1,323 @@
+package com.thealgorithms.datastructures.trees;
+
+import java.util.LinkedList;
+import java.util.List;
+
+/**
+ * Implementation of a Splay Tree data structure.
+ *
+ * <p>
+ * A splay tree is a self-adjusting binary search tree with the additional property
+ * that recently accessed elements are quick to access again. It performs basic
+ * operations such as insertion, deletion, and searching in O(log n) amortized time,
+ * where n is the number of elements in the tree.
+ * </p>
+ *
+ * <p>
+ * The key feature of splay trees is the splay operation, which moves a node closer
+ * to the root of the tree when it is accessed. This operation helps to maintain
+ * good balance and improves the overall performance of the tree. After performing
+ * a splay operation, the accessed node becomes the new root of the tree.
+ * </p>
+ *
+ * <p>
+ * Splay trees have applications in various areas, including caching, network routing,
+ * and dynamic optimality analysis.
+ * </p>
+ */
+public class SplayTree {
+
+    private static class Node {
+        int key;
+        Node left, right;
+
+        Node(int key) {
+            this.key = key;
+            left = right = null;
+        }
+    }
+
+    private Node root;
+
+    /**
+     * Constructs an empty SplayTree.
+     */
+    public SplayTree() {
+        root = null;
+    }
+
+    /**
+     * Zig operation.
+     *
+     * <p>
+     * The zig operation is used to perform a single rotation on a node to move it closer to
+     * the root of the tree. It is typically applied when the node is a left child of its parent
+     * and needs to be rotated to the right.
+     * </p>
+     *
+     * @param x The node to perform the zig operation on.
+     * @return The new root node after the operation.
+     */
+    private Node rotateRight(Node x) {
+        Node y = x.left;
+        x.left = y.right;
+        y.right = x;
+        return y;
+    }
+
+    /**
+     * Zag operation.
+     *
+     * <p>
+     * The zag operation is used to perform a single rotation on a node to move it closer to
+     * the root of the tree. It is typically applied when the node is a right child of its parent
+     * and needs to be rotated to the left.
+     * </p>
+     *
+     * @param x The node to perform the zag operation on.
+     * @return The new root node after the operation.
+     */
+    private Node rotateLeft(Node x) {
+        Node y = x.right;
+        x.right = y.left;
+        y.left = x;
+        return y;
+    }
+
+    /**
+     * Splay operation.
+     *
+     * <p>
+     * The splay operation is the core operation of a splay tree. It moves a specified node
+     * closer to the root of the tree by performing a series of rotations. The goal of the splay
+     * operation is to improve the access time for frequently accessed nodes by bringing them
+     * closer to the root.
+     * </p>
+     *
+     * <p>
+     * The splay operation consists of three main cases:
+     * <ul>
+     * <li>Zig-Zig case: Perform two consecutive rotations.</li>
+     * <li>Zig-Zag case: Perform two consecutive rotations in opposite directions.</li>
+     * <li>Zag-Zag case: Perform two consecutive rotations.</li>
+     * </ul>
+     * </p>
+     *
+     * <p>
+     * After performing the splay operation, the accessed node becomes the new root of the tree.
+     * </p>
+     *
+     * @param root The root of the subtree to splay.
+     * @param key  The key to splay around.
+     * @return The new root of the splayed subtree.
+     */
+    private Node splay(Node root, int key) {
+        if (root == null || root.key == key) return root;
+
+        if (root.key > key) {
+            if (root.left == null) return root;
+            // Zig-Zig case
+            if (root.left.key > key) {
+                // Recursive call to splay on grandchild
+                root.left.left = splay(root.left.left, key);
+                // Perform zig operation on parent
+                root = rotateRight(root);
+            } // Zig-Zag case
+            else if (root.left.key < key) {
+                // Recursive call to splay on grandchild
+                root.left.right = splay(root.left.right, key);
+                // Perform zag operation on parent
+                if (root.left.right != null) root.left = rotateLeft(root.left);
+            }
+
+            return (root.left == null) ? root : rotateRight(root);
+        } else {
+            if (root.right == null) return root;
+            // Zag-Zag case
+            if (root.right.key > key) {
+                // Recursive call to splay on grandchild
+                root.right.left = splay(root.right.left, key);
+                // Perform zig operation on parent
+                if (root.right.left != null) root.right = rotateRight(root.right);
+            } // Zag-Zig case
+            else if (root.right.key < key) {
+                // Recursive call to splay on grandchild
+                root.right.right = splay(root.right.right, key);
+                // Perform zag operation on parent
+                root = rotateLeft(root);
+            }
+
+            return (root.right == null) ? root : rotateLeft(root);
+        }
+    }
+
+    /**
+     * Insert a key into the SplayTree.
+     *
+     * @param key The key to insert.
+     */
+    public void insert(int key) {
+        root = insertRec(root, key);
+        root = splay(root, key);
+    }
+
+    /**
+     * Recursive function to insert a key.
+     *
+     * @param root The root of the subtree to insert the key into.
+     * @param key  The key to insert.
+     * @return The root of the modified subtree.
+     */
+    private Node insertRec(Node root, int key) {
+        if (root == null) return new Node(key);
+
+        if (root.key > key) {
+            root.left = insertRec(root.left, key);
+        } else if (root.key < key) {
+            root.right = insertRec(root.right, key);
+        }
+
+        return root;
+    }
+
+    /**
+     * Search for a key in the SplayTree.
+     *
+     * @param key The key to search for.
+     * @return True if the key is found, otherwise false.
+     */
+    public boolean search(int key) {
+        root = splay(root, key);
+        return root != null && root.key == key;
+    }
+
+    /**
+     * Delete a key from the SplayTree.
+     *
+     * @param key The key to delete.
+     */
+    public void delete(int key) {
+        root = deleteRec(root, key);
+    }
+
+    /**
+     * Recursive function to delete a key.
+     *
+     * @param root The root of the subtree to delete the key from.
+     * @param key  The key to delete.
+     * @return The root of the modified subtree.
+     */
+    private Node deleteRec(Node root, int key) {
+        if (root == null) return null;
+
+        if (root.key > key) {
+            root.left = deleteRec(root.left, key);
+        } else if (root.key < key) {
+            root.right = deleteRec(root.right, key);
+        } else {
+            // Found the node to delete
+            if (root.left == null)
+                return root.right;
+            else if (root.right == null)
+                return root.left;
+
+            // Node with two children: Get the inorder successor (smallest in the right subtree)
+            root.key = minValue(root.right);
+
+            // Delete the inorder successor
+            root.right = deleteRec(root.right, root.key);
+        }
+
+        return root;
+    }
+
+    /**
+     * Find the minimum value in a subtree.
+     *
+     * @param root The root of the subtree to find the minimum value in.
+     * @return The minimum value in the subtree.
+     */
+    private int minValue(Node root) {
+        int minValue = root.key;
+        while (root.left != null) {
+            minValue = root.left.key;
+            root = root.left;
+        }
+        return minValue;
+    }
+
+    /**
+     * Perform an in-order traversal of the SplayTree.
+     *
+     * @return A vector containing the keys in in-order traversal order.
+     */
+    public List<Integer> inOrder() {
+        List<Integer> result = new LinkedList<>();
+        inOrderRec(root, result);
+        return result;
+    }
+
+    /**
+     * Recursive function for in-order traversal.
+     *
+     * @param root   The root of the subtree to traverse.
+     * @param result The vector to store the traversal result.
+     */
+    private void inOrderRec(Node root, List<Integer> result) {
+        if (root != null) {
+            inOrderRec(root.left, result);
+            result.add(root.key);
+            inOrderRec(root.right, result);
+        }
+    }
+
+    /**
+     * Perform a pre-order traversal of the SplayTree.
+     *
+     * @return A vector containing the keys in pre-order traversal order.
+     */
+    public List<Integer> preOrder() {
+        List<Integer> result = new LinkedList<>();
+        preOrderRec(root, result);
+        return result;
+    }
+
+    /**
+     * Recursive function for pre-order traversal.
+     *
+     * @param root   The root of the subtree to traverse.
+     * @param result The vector to store the traversal result.
+     */
+    private void preOrderRec(Node root, List<Integer> result) {
+        if (root != null) {
+            result.add(root.key);
+            preOrderRec(root.left, result);
+            preOrderRec(root.right, result);
+        }
+    }
+
+    /**
+     * Perform a post-order traversal of the SplayTree.
+     *
+     * @return A vector containing the keys in post-order traversal order.
+     */
+    public List<Integer> postOrder() {
+        List<Integer> result = new LinkedList<>();
+        postOrderRec(root, result);
+        return result;
+    }
+
+    /**
+     * Recursive function for post-order traversal.
+     *
+     * @param root   The root of the subtree to traverse.
+     * @param result The vector to store the traversal result.
+     */
+    private void postOrderRec(Node root, List<Integer> result) {
+        if (root != null) {
+            postOrderRec(root.left, result);
+            postOrderRec(root.right, result);
+            result.add(root.key);
+        }
+    }
+}