Linked List Programs in C

A linked-list is a sequence of data structures which are connected together via links.

Linked List is a sequence of links which contains items. Each link contains a connection to another link. Linked list the second most used data structure after array. Following are important terms to understand the concepts of Linked List.

• Link − Each Link of a linked list can store a data called an element.

• Next − Each Link of a linked list contain a link to next link called Next.

• LinkedList − A LinkedList contains the connection link to the first Link called First.

Here in this section we shall learn basic programming techniques using linked-lists.

Simple (Singly) Linked List

This linked list has sequential one-way connection with adjacent nodes. It can only be parsed one-way. Here we shall learn the basic operation of singly list list.

• Create Linked List

• Display Linked List in Reverse

• Find size of Linked List

• Search an Item in Linked List

• Update an Item in Linked List

• Remove an Item from Linked List

• Combine Two Linked List

• Split Linked List into two

Circular Linked List

Circular Linked List is a variation of Linked list in which first element points to last element and last element points to first element.

• Create Linked List

• Display Linked List in Reverse

• Find size of Linked List

• Search an Item in Linked List

• Update an Item in Linked List

• Remove an Item from Linked List

• Combine Two Circular Linked List

• Split Linked List into two

Doubly Linked List

Doubly Linked List is a variation of Linked list in which navigation is possible in both ways either forward and backward.

• Create Linked List

• Display Linked List in Reverse

• Find size of Linked List

• Search an Item in Linked List

• Update an Item in Linked List

• Remove an Item from Linked List

• Combine Two Doubly Linked List

• Split Linked List into two