mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-09 03:59:38 +08:00
Fix spelling (#3444)
This commit is contained in:

committed by
GitHub

parent
b75dce17c3
commit
eb375a6015
@ -22,10 +22,10 @@ The `next` variable points to the next node in the data structure and value stor
|
|||||||
|
|
||||||
### File descriptions:
|
### File descriptions:
|
||||||
|
|
||||||
1. `CircleLinkedList.java` : A circular linked list where next pointer of last node points to first nide of linked list.
|
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.
|
2. `SinglyLinkedList.java` : The classic case of single links.
|
||||||
3. `CountSinglyLinkedListRecursion.java`: Recursively counts the size of a list.
|
3. `CountSinglyLinkedListRecursion.java`: Recursively counts the size of a list.
|
||||||
4. `CreateAndDetectLoop.java` : Create and detect a loop in a linked 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.
|
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.
|
||||||
|
Reference in New Issue
Block a user