Linked List is a very commonly used linear data structure which consists of group of nodes in a sequence.
Each node holds its own data and the address of the next node hence forming a chain like structure.
Linked Lists are used to create trees and graphs.
There are 3 different implementations of Linked List available, they are:
Let's know more about them and how they are different from each other.
Singly linked lists contain nodes which have a data part as well as an address part i.e.
next, which points to the next node in the sequence of nodes.
The operations we can perform on singly linked lists are insertion, deletion and traversal.
In a doubly linked list, each node contains a data part and two addresses, one for the previous node and one for the next node.
In circular linked list the last node of the list holds the address of the first node hence forming a circular chain.
We will learn about all the 3 types of linked list, one by one, in the next tutorials. So click on Next button, let's learn more about linked lists.