LINKED LIST
A linked list consists of a data element known as a node. And each node consists of two fields: one field has data, and in the second field, the node has an address that keeps a reference to the next node.
Introduction:-
A linked list is a data structure that stores a sequence of elements. Each element in the list is called a node, and each node has a reference to the next node in the list. The first node in the list is called the head, and the last node in the list is called the tail.
TYPES OF LINKED LIST:-
The following are the types of linked list:
- Singly Linked list.
- Doubly Linked list.
- Circular Linked list.
- Doubly Circular Linked list
EXAMPLES OF LINKED LIST:-
Format:[data,address]
Head->[3,1000]->[43,1001]->[21,1002]
In the example, the number 43 is present at location 1000 and the address is present at in the previous node. This is how a linked list is represented.
