Stacks and Queues for ToDos

Project information

The purpose of this program is to implement a binder that uses stacks and queues to store todo items. The data structures of this program are stack and queue. The stack in the program is implemented using a linear linked list of arrays. Each element in the linked list represents a binder and contains an array to store the todo items. The queue is implemented using a circular linked list. Each node in the linked list represents a todo item.

Language : C++

6 Commits
1 Branch
0 Tags

Created on

April 25, 2023

Copy SSH clone URLgit@gitlab.cecs.pdx.edu:ctn4/cs163-009-program2.git
Copy HTTPS clone URLhttps://gitlab.cecs.pdx.edu/ctn4/cs163-009-program2.git

Loading