LinkedList Creation and Modification in C
Project Overview
This project demonstrates the implementation of a singly linked list in C, designed to store integer data. By leveraging dynamic memory allocation and modular programming, the linked list provides an efficient way to manage data with flexibility for insertion, deletion, and traversal operations. The program also includes robust input validation to ensure reliable user interaction.
Features
- Create a Linked List: Initializes a new linked list with a head node set to NULL.
- Change a Value: Modifies the value at a specific index, validating that the index exists in the list. Feedback is provided for invalid indices.
- Print the List: Iterates through the list, printing the data in each node sequentially.
- Append an Item: Adds a new node to the end of the list, dynamically allocating memory for the node.
- Delete an Item: Removes a node at a specific index, ensuring references are updated correctly. Invalid indices prompt an error message.
- Insert an Item: Inserts a node with specified data at a given index, shifting subsequent nodes to maintain order.
Technical Highlights
- Language: C
- Dynamic Memory Allocation: Utilized malloc from <stdlib.h> to create and manage nodes.
- Data Structure: Singly linked list implemented using a Node structure defined with typedef.
- Functionality: Operations include creating, appending, inserting, deleting, and traversing nodes.
- Modular Design: Structure and functions are organized into separate header (linkedlist.h) and implementation (linkedlist.c) files.
Interactive Menu
The program features a user-friendly menu in the main.c file, allowing users to:
- Create a new list
- Print the current list
- Append an item to the list
- Delete an item from the list
- Insert an item into the list
- Quit