Skip to content

Commit 0e87689

Browse files
author
Jitendra Singh
authored
change points to point
1 parent 5080b28 commit 0e87689

1 file changed

Lines changed: 1 addition & 1 deletion

File tree

README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -30,7 +30,7 @@ Interviews
3030
* A *Linked List* is a linear collection of data elements, called nodes, each
3131
pointing to the next node by means of a pointer. It is a data structure
3232
consisting of a group of nodes which together represent a sequence.
33-
* **Singly-linked list**: linked list in which nodes have pointers to the next node and the last node points to null
33+
* **Singly-linked list**: linked list in which nodes have pointers to the next node and the last node point to null
3434
* **Doubly-linked list**: linked list in which nodes have two pointers which points to *both* the previous node and the next node
3535
* **Circular-linked list**: linked list in which nodes have pointers to the next node and the last node points again to the head
3636
* Time Complexity:

0 commit comments

Comments
 (0)