Skip to content

Commit eb375a6

Browse files
authored
Fix spelling (TheAlgorithms#3444)
1 parent b75dce1 commit eb375a6

File tree

1 file changed

+2
-2
lines changed
  • src/main/java/com/thealgorithms/datastructures/lists

1 file changed

+2
-2
lines changed

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

+2-2
Original file line numberDiff line numberDiff line change
@@ -22,10 +22,10 @@ The `next` variable points to the next node in the data structure and value stor
2222

2323
### File descriptions:
2424

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.
2626
2. `SinglyLinkedList.java` : The classic case of single links.
2727
3. `CountSinglyLinkedListRecursion.java`: Recursively counts the size of a list.
2828
4. `CreateAndDetectLoop.java` : Create and detect a loop in a linked list.
2929
5. `DoublyLinkedList.java` : A modification of singly linked list which has a `prev` pointer to point to the previous node.
3030
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

Comments
 (0)