This project implements a To-Do List using a Priority Queue data structure. It allows you to manage your tasks efficiently based on their priorities and track completed tasks.
- Add a Task: Add a new task with a priority level to the list.
- Remove a Task: Remove a task from the list.
- Mark Task as Completed: Mark a task as completed.
- Display All Tasks with Priority: View all tasks along with their priorities.
- Retrieve Highest Priority Task: Get the highest priority task that needs to be done.
- Display All Completed Tasks: View all completed tasks.
- Exit: Close the application.
- Clone or download the project.
- Compile and run the C code.
- Use the provided menu to interact with the To-Do List.
- Tasks and their priorities are stored in a linked list.
- The
push
function inserts tasks according to their priority. - The
completed
attribute is used to mark tasks as completed.
- Choose from the menu options to add, remove, complete, and manage tasks.
- View the highest priority tasks to determine which task to complete next.
- Keep track of your completed tasks using the display feature.
Feel free to contribute to this project by opening issues, suggesting enhancements, or making pull requests.
This project is open-source and available under the MIT License.
- This project was created as part of a data structures course.
- My Team Members for this project: Yashank Kothari and Sanika Lunawat
For any questions or feedback, please contact Minav Karia at [email protected].
Enjoy managing your tasks with the To-Do List with Priority Queue!