This project implements a Queue using a singly linked list in C The queue follows the FIFO (First In, First Out) principle, allowing users to perform operations such as enqueue, dequeue, and display.

isEmpty() -> true if the queue is empty insert() -> add element to queue extract() -> remove and return first element in queue revolution() -> reverse the queue everything was coded with this ...