Aim

The objective of this lab is to implement a singly linked list data structure and perform basic operations like insertion, deletion, and traversal. You will also need to handle edge cases such as an empty list or a list with only one node.

What is a Linked List?

A linked list is a linear data structure in which elements, also called nodes, are linked using pointers. Each node contains two fields: data and a reference (link) to the next node in the sequence. Linked lists are dynamic, meaning they can grow and shrink during runtime.

Types of Linked Lists

There are various types of linked lists:

• Singly Linked List: Each node points to the next node in the list and the last node points to null.
• Doubly Linked List: Each node has two pointers, one pointing to the next node and one to the previous node.
• Circular Linked List: In a circular linked list, the last node points back to the first node, creating a loop.

Applications of Linked Lists

Linked lists are used in a variety of applications:

• Dynamic memory allocation
• Implementation of stacks and queues
• Handling of music playlists or images in a slideshow
• Undo functionality in software applications