Singly Linked List in C

Here you will learn about singly linked list in C.

What is Singly Linked List (SLL)?

The simplest kind of linked list is a singly liked list (SLL) which has one link per node. It has two parts, one part contains data and other contains address of next node. The structure of a node in a SLL is given as in C:

 

 

The program is given below that will perform insertion, deletion and display a singly linked list.

Singly Linked List in C

 

Output
—- Singly Linked List(SLL) Menu —-
1.Insert
2.Display
3.Delete
4.ExitEnter your choice(1-4):1—- Insert Menu —-
1.Insert at beginning
2.Insert at end
3.Insert at specified position
4.ExitEnter your choice(1-4):1
Enter data:4—- Singly Linked List(SLL) Menu —-
1.Insert
2.Display
3.Delete
4.ExitEnter your choice(1-4):2
The linked list is:
4->

—- Singly Linked List(SLL) Menu —-
1.Insert
2.Display
3.Delete
4.Exit

Enter your choice(1-4):4

21 thoughts on “Singly Linked List in C”

  1. whoa !!.. awesome program but it's countering a problem while displaying the list it says list is empty though i've inserted numbers in the beginning and end both then i inserted at desired position n then chose option 4 i.e display it saying that list is empty and then it says press any key to continue i've done accordingly but it repeatedly says press any key to cont. … agn n agn so problem is in d code of display please can ya wrk on it ??…

  2. the program is not working …so many errors are there . please do it properly before putting it on website. you just wasted my time.

  3. Delete end will not work for linked list with single element.
    q->next->next can generate errors if q->next is NULL.
    You can change by using an additional pointer.

  4. If you try to delete the first element in with the list containing only one element, it gives an error. Please fix it.

Leave a Comment

Your email address will not be published. Required fields are marked *