Add description for SkipList.java (#3503)

This commit is contained in:
Tanmay Jadhav
2022-12-28 17:31:05 +05:30
committed by GitHub
parent c6694fc1bd
commit 6a0035d872

View File

@ -29,3 +29,4 @@ The `next` variable points to the next node in the data structure and value stor
5. `DoublyLinkedList.java` : A modification of singly linked list which has a `prev` pointer to point to the previous node. 5. `DoublyLinkedList.java` : A modification of singly linked list which has a `prev` pointer to point to the previous node.
6. `Merge_K_SortedLinkedlist.java` : Merges K sorted linked list with mergesort (mergesort is also the most efficient sorting algorithm for linked list). 6. `Merge_K_SortedLinkedlist.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. 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.