The Travel Itinerary Planner is a console-based application that enables users to create and manage travel plans by adding, viewing, and deleting stops along their journey. This project, written in C, uses linked lists to allow dynamic handling of multiple destinations. Each stop records a location, date, and description, providing a structured way to organize trips.
Features - Add Stop: Easily add new travel destinations with customized details, including the location, date, and description. View Itinerary: Display the complete list of stops in order, showing each destination's information. Delete Stop: Remove any stop by location, allowing users to keep their itinerary updated and accurate. Purpose - This project showcases practical use of C language features such as linked lists, memory allocation, and dynamic data management. By creating an itinerary planner, the project demonstrates effective handling of user input, dynamic structures, and command-line interactions, making it ideal for learning or practicing fundamental C programming concepts.
How It Works - The program maintains an itinerary as a linked list, where each node represents a travel stop. Each node is created or removed based on user input:
Add a Stop: Creates a new node with the location, date, and description, then links it to the list. View Itinerary: Traverses the list to display all stops sequentially. Delete a Stop: Finds and removes the specified node by comparing locations, adjusting links accordingly. Getting Started
Technologies -
Language: C Data Structure: Linked List