top of page

To-Do List Manager


Course: Computer Science 2: Data Structures (2270)

Time Frame: December 2018

GitHub: Link

For my final project in Data Structures, I created a to-do list manager. To-do items (tasks like calc homework, for example) are stored in a Binary Search Tree sorted by urgency.

The user interacts with the program through a menu. They can edit, add, and complete tasks. They can also view a random task or the most urgent task currently on the to-do list.

The program reads from and saves to a text file which enables the user to exit without losing their changes. The diagram to the right shows the general flow of the program.

For more information, including the code and a sample run through, please see the full project on GitHub.

bottom of page