Implemented Queue Data Structure

[Ramy-Badr-Ahmed]

This PR adds an implementation of the Queue data structure using mutable arrays within the Haskedll ST monad.

The queue supports typical queue operations such as enqueue, dequeue, and checking for emptiness.

Implementation Details:

• newQueue :: Int -> ST s (Queue s a): Initializes a new queue with a given capacity.
• enqueue :: Queue s a -> a -> ST s (): Adds an element to the end of the queue.
• dequeue :: Queue s a -> ST s (Maybe a): Removes an element from the front of the queue. Returns Nothing if the queue is empty.
• isEmptyQueue :: Queue s a -> ST s Bool: Checks if the queue is empty.

Testing:

A testing function that enqueues a list of elements, then dequeues them, and checks if the queue was empty before and after operations.

• testQueue :: [a] -> ([Maybe a], Bool, Bool)
• main :: IO (): tests the queue implementation
• Input:
  let input = [1, 2, 3, 4, 5]
• Expected Output
  [Just 1, Just 2, Just 3, Just 4, Just 5]
False
True

[Ramy-Badr-Ahmed]

Closed it and combined it with #54