40 Basic Linked List Programs in C

These programs cover fundamental operations on Singly, Doubly and Circular linked lists in C programming language.

Singly Linked List Programs

# Program Name Description Resources
1 Create and Display Create a linked list and display its elements GeeksforGeeks
2 Insert at Beginning Insert a node at the start of the list GeeksforGeeks
3 Insert at End Insert a node at the end of the list GeeksforGeeks
4 Insert at Position Insert a node at a specific position GeeksforGeeks
5 Delete from Beginning Delete the first node of the list GeeksforGeeks
6 Delete from End Delete the last node of the list GeeksforGeeks
7 Delete by Value Delete a node with specific value GeeksforGeeks
8 Delete all Delete all occurrences of a given key GeeksforGeeks
9 Count Nodes Count number of nodes in the list GeeksforGeeks
10 Search Element Search for an element in the list GeeksforGeeks

Doubly Linked List Programs

# Program Name Description Resources
11 Create and Display Create and display a doubly linked list GeeksforGeeks
12 Insert at Beginning Insert node at start of doubly linked list GeeksforGeeks
13 Insert at End Insert node at end of doubly linked list GeeksforGeeks
14 Insert at Position Insert node at specific position GeeksforGeeks
15 Delete from Beginning Delete first node of doubly linked list GeeksforGeeks
16 Delete from End Delete last node of doubly linked list GeeksforGeeks
17 Delete by Value Delete node with specific value GeeksforGeeks
18 Reverse List Reverse a doubly linked list GeeksforGeeks
19 Circular Doubly List Implement circular doubly linked list GeeksforGeeks
20 Merge Two Lists Merge two sorted doubly linked lists GeeksforGeeks

Circular Linked List Programs

# Program Name Description Resources
21 Create and Display Create and display circular linked list GeeksforGeeks
22 Insert at Beginning Insert node at start of circular list GeeksforGeeks
23 Insert at End Insert node at end of circular list GeeksforGeeks
24 Insert at Position Insert node at specific position GeeksforGeeks
25 Delete from Beginning Delete first node of circular list GeeksforGeeks
26 Delete from End Delete last node of circular list GeeksforGeeks
27 Delete by Value Delete node with specific value GeeksforGeeks
28 Count Nodes Count nodes in circular list GeeksforGeeks
29 Search Element Search for element in circular list GeeksforGeeks
30 Split Circular List Split circular list into two halves GeeksforGeeks
31 Sorted Insert Insert node in sorted circular list GeeksforGeeks
32 Check if Circular Check if linked list is circular GeeksforGeeks
33 Convert to Circular Convert singly list to circular GeeksforGeeks
34 Josephus Problem Solve Josephus problem using circular list GeeksforGeeks
35 Exchange First/Last Exchange first and last nodes GeeksforGeeks
36 Reverse Circular List Reverse a circular linked list GeeksforGeeks
37 Delete All Nodes Delete all nodes of circular list GeeksforGeeks
38 Count nodes Count nodes of given value GeeksforGeeks
39 Remove Duplicates Remove duplicates from sorted list GeeksforGeeks
40 Merge Two Circular Lists Merge two sorted circular lists GeeksforGeeks
Related Data Structure Resources
Interview Questions
MCQs
Problem Solving Tricks
Tech Hub