Update README.md

Author: Rahilralu

src/main/java/com/thealgorithms/datastructures/lists/README.md

@@ -22,11 +22,38 @@ The `next` variable points to the next node in the data structure and value stor
 
 ### File descriptions:
 
-1. `CircleLinkedList.java` : A circular linked list where next pointer of last node points to first node of linked list.
-2. `SinglyLinkedList.java` : The classic case of single links.
-3. `CountSinglyLinkedListRecursion.java`: Recursively counts the size of a list.
-4. `CreateAndDetectLoop.java` : Create and detect a loop in a linked list.
-5. `DoublyLinkedList.java` : A modification of singly linked list which has a `prev` pointer to point to the previous node.
-6. `MergeKSortedLinkedlist.java` : Merges K sorted linked list with mergesort (mergesort is also the most efficient sorting algorithm for linked list).
-7. `RandomNode.java` : Selects a random node from given linked list and diplays it.
-8. `SkipList.java` : Data Structure used for storing a sorted list of elements with help of a Linked list hierarchy that connects to subsequences of elements.
+1.CircleLinkedList.java : A circular linked list where the next pointer of the last node points to the first node of the linked list.
+
+2.CircularDoublyLinkedList.java : A circular doubly linked list with next and prev pointers, where the last node points back to the first node.
+
+3.SinglyLinkedList.java : The classic single linked list implementation.
+
+4.SinglyLinkedListNode.java : Node class used for singly linked lists.
+
+5.CountSinglyLinkedListRecursion.java : Recursively counts the size of a singly linked list.
+
+6.CreateAndDetectLoop.java : Creates and detects a loop in a linked list.
+
+7.DoublyLinkedList.java : A modification of singly linked list with a prev pointer to point to the previous node.
+
+8.MergeKSortedLinkedList.java : Merges K sorted linked lists using merge sort.
+
+9.MergeSortedSinglyLinkedList.java : Merges two sorted singly linked lists.
+
+10.MergeSortedArrayList.java : Merges sorted array lists (linked list variant).
+
+11.QuickSortLinkedList.java : Implements quicksort on a linked list.
+
+12.RandomNode.java : Selects a random node from a given linked list and displays it.
+
+13.ReverseKGroup.java : Reverses nodes in k-sized groups in a linked list.
+
+14.RotateSinglyLinkedLists.java : Rotates a singly linked list by k positions.
+
+15.SearchSinglyLinkedListRecursion.java : Searches a node in a singly linked list recursively.
+
+16.SortedLinkedList.java : Implements a linked list that maintains sorted order on insertion.
+
+17.CursorLinkedList.java : Implements linked list using cursor-based approach.
+
+18.SkipList.java : Stores a sorted list of elements using a linked list hierarchy connecting subsequences of elements.