LinkedQueue is a simple implementation of a Queue DS using a Doubly Linked List
-
Updated
Aug 9, 2022 - C++
LinkedQueue is a simple implementation of a Queue DS using a Doubly Linked List
Implemented a double ended dequeue data structure using a doubly linked list to support various data manipulations. Architected project to achieve O(1) runtime for multiple functions and O(N) worst case.
Some codes for Queue operations such as Queue with Array, Circular Queue with Array, Queue with Linked List, Circular Queue with Linked List, Circular Queue Linked List Splitting. These are having operations such as enqueue, dequeue, traverse, insertion, deletion, traverse, isEmpty, isFull, searching etc. ( in C++)
Homework for the Data Structures course @ ACS, UPB 2018.
Add a description, image, and links to the queue-data-stucture topic page so that developers can more easily learn about it.
To associate your repository with the queue-data-stucture topic, visit your repo's landing page and select "manage topics."