A
singly-linked
list is a type of linked list in which each node has a reference to the next node in the list, but not the previous node
Singly-linked lists are useful for
implementing
stacks and for quickly traversing a list in one direction
Singly-linked lists have a
c
onstant
-time
insert and delete operation, but a linear-time search operation
In a singly-linked list, the
tail
node has a reference to null, indicating the end of the list.
Singly-linked lists have less
overhead
than doubly-linked lists, as each node only requires a single reference to the next node
Some common
operations
on singly-linked lists include inserting, deleting, and searching for a specific node.
Singly-linked lists are
vulnerable
to certain types of errors, such as the loss of the head reference
Get Familiar with the circular linked list