Skip to content

Developed code to modify circular queue and stack data structures so that each can be implemented with linked lists or arrays for internal storage, instead of their built-in data type

Notifications You must be signed in to change notification settings

hannahgsimon/DataStructures

Repository files navigation

The program has the following menu options:
1- Author Info
2- Add Stack Array Data
3- Add Stack List Data
4- Add Queue Array Data
5- Add Queue List Data
6- Remove Stack Array Data
7- Remove Stack List Data
8- Remove Queue Array Data
9- Remove Queue List Data
10- Get Max Pending Data
11- Print Data
0- Exit

Program Files:
Project_StackQueueLinkedList.java - This contains main.
QueueList.java - Queue data structure, I modified so that it does not use a built-in queue data type, instead I implemented my own queue using a Linked List (I implemented a Linked List as well, did not use a built-in type) for internal storage.
StackArray.java - Stack data structure, I modified it so that it does not use a built-in stack data type, instead I implemented my own stack using an array for internal storage.
QueueArray.java - Queue data structure, I modified it so that it does not use a built-in queue data type, instead I implemented my own queue using an array for internal storage. The queue is circular.
StackList.java - Stack data structure, I modified it so that it does not use a built-in stack data type, instead I implemented my own stack using a Linked List (which I implemented as well) for internal storage.
Node.java
SampleData.java

About

Developed code to modify circular queue and stack data structures so that each can be implemented with linked lists or arrays for internal storage, instead of their built-in data type

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages