Types of Linked List

1. Singly Linked list
2. Doubly Linked list
3. Circular Linked list

---

Singly Linked List

In this type of linked list two nodes are linked with each other in sequential linear manner. Movement in forward direction is possible.

---

Doubly Linked List

In this type of liked list each node holds two-pointer field. Pointers exist between adjacent nodes in both directions.The list can be traversed either forward or backward.

---

Circular Linked List

In circular linked list the first and last node are adjacent.

---

Operation On Linked list

S no	Opration	Singly	Doubly	Circular
1	Creating a linked list	GO
2	Traversing the linked list
3	Printing the linked list
4	Counting the nodes in linked list
5	Searching an item in linked list	Go
6	Inserting an item in linked list	Insertion At Beginning At Location	Insertion At Beginning At Location At Last	Insertion At Beginning At Location At Last
7	Deleting an item.	Deletion At Beginning At Last		Deletion At Beginning At Location At Last
8	Concatination of two list
9	Inversion
10	Sorting of elements	Go
11	Merging of two sorted linked list
12	Saperating a linked list in two linked list