This C program demonstrates basic operations on a singly linked list, including insertion at the beginning and end, traversal, and deletion from the beginning and end.
This program implements a simple singly linked list with the following operations:
- Insertion at the Beginning: Adds a new element to the beginning of the linked list.
- Insertion at the End: Adds a new element to the end of the linked list.
- Traversal: Displays the elements of the linked list.
- Deletion from the Beginning: Removes the first element from the linked list.
- Deletion from the End: Removes the last element from the linked list.