You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: src/main/java/com/thealgorithms/datastructures/lists/README.md
+2-2
Original file line number
Diff line number
Diff line change
@@ -22,10 +22,10 @@ The `next` variable points to the next node in the data structure and value stor
22
22
23
23
### File descriptions:
24
24
25
-
1.`CircleLinkedList.java` : A circular linked list where next pointer of last node points to first nide of linked list.
25
+
1.`CircleLinkedList.java` : A circular linked list where next pointer of last node points to first node of linked list.
26
26
2.`SinglyLinkedList.java` : The classic case of single links.
27
27
3.`CountSinglyLinkedListRecursion.java`: Recursively counts the size of a list.
28
28
4.`CreateAndDetectLoop.java` : Create and detect a loop in a linked list.
29
29
5.`DoublyLinkedList.java` : A modification of singly linked list which has a `prev` pointer to point to the previous node.
30
30
6.`Merge_K_SortedLinkedlist.java` : Merges K sorted linked list with mergesort (mergesort is also the most efficient sorting algorithm for linked list).
31
-
7.`RandomNode.java` : Selects a random node from given linked list and diplays it.
31
+
7.`RandomNode.java` : Selects a random node from given linked list and diplays it.
0 commit comments