TYPES OF LINKED LIST
1. Singly linked list
2. Doubly linked list
3. Circular linked list
Singly linked list
A separately connected list is a sort of connected list that is unidirectional, that is
to say, it tends to be navigated in just a single bearing from head to the last node
(tail).
Every component in a connected list is known as a node. A solitary(single) node
contains information and a pointer to the following node which helps in keeping
up with the design of the list.
The principal(first) node is known as the head; it focuses to the primary node of
the list and assists us with getting to each and every component in the list. The
last node, additionally some of the time called the tail, focuses to NULL which
helps us in deciding when the list closes.
, Operations on Singly Linked List:
1. Singly linked list
2. Doubly linked list
3. Circular linked list
Singly linked list
A separately connected list is a sort of connected list that is unidirectional, that is
to say, it tends to be navigated in just a single bearing from head to the last node
(tail).
Every component in a connected list is known as a node. A solitary(single) node
contains information and a pointer to the following node which helps in keeping
up with the design of the list.
The principal(first) node is known as the head; it focuses to the primary node of
the list and assists us with getting to each and every component in the list. The
last node, additionally some of the time called the tail, focuses to NULL which
helps us in deciding when the list closes.
, Operations on Singly Linked List:
