Linked lists can be -
Linked lists can be:-
Linked lists:-
A linked list is a linear collection of data elements, whose order is not given by their physical placement in memory. Instead, each element points to the next. It is a data structure consisting of a collection of nodes which together represent a sequence.
1) Single:-
Single linked list, each node in the list stores the contents and a pointer or reference to the next node in the list. It does not store any pointer or reference to the previous node. The last node in a single linked list points to nothing.
2) Double:-
A double linked list is a linked data structure that consists of a set of sequentially linked records called nodes. Each node contains two fields, called links, that are references to the previous and to the next node in the sequence of nodes.
3) Circular:-
Circular Linked List is a variation of Linked list in which the first element points to the last element and the last element points to the first element. Both Single Linked List and Double Linked List can be made into a circular linked list.