A linked list is a dynamic data structure where each element (called a node) is made up of two items: the data and a reference (or pointer), which points to the next node.
In this repository , you will learn like......
How to craete liked list
How to insert in a linked list
Counting the number of nodes i.e length of linked list
Sorting in a linked list
Reversing a linked list
#Circular Linked List
Circular linked list is a linked list where all nodes are connected to form a circle. There is no NULL at the end. A circular linked list can be a singly circular linked list or doubly circular linked list.