This repository hosts a Python implementation of the Queue Abstract Data Type (ADT) utilizing a linked list for efficient operation. It is designed for those who need a reliable and extendable queue system with the fundamental operations of enqueue (insert), dequeue (remove), and peek (retrieve). The package also features a user-friendly, interactive command-line interface (CLI) for effortless management and visualization of the queue's content.
- Enqueue: Add elements to the end of the queue.
- Dequeue: Remove elements from the front of the queue.
- Peek: Look at the element at the front without removing it.
- Size: Get the current number of elements.
- IsEmpty: Check if the queue is empty.
- Display: Show all elements in the queue.
- Clear: Empty the queue completely.
- Reverse: Reverse the order of elements.
- Clone the repository to your local machine.
- Run the script via a Python interpreter.
- Use the interactive menu to perform operations on the queue.
- Python 3.x
Contributions, issues, and feature requests are welcome. Feel free to check the issues page if you want to contribute.
Distributed under the MIT License. See LICENSE for more information.