Feature - Add Queue Data Structure Implementation

[EricNeves]

📋 Overview This pull request introduces the implementation of a queue data structure, providing essential operations and functionality.

✅ Features

• Enqueue and Dequeue: Allows adding and removing elements from the queue.
• IsEmpty: Checks if the queue is empty.
• Size: Returns the number of elements in the queue.
• Peek: Views the front element without removing it.
• Clear: Empties all elements from the queue.
• ToString: Returns a string representation of the queue.

🔍 Details

• Implemented core methods: enqueue, dequeue, isEmpty, size, peek, clear, and toString.
• Implemented tests: Ensured the reliability and correctness of the queue operations.

Please review the changes and let me know if there are any suggestions or improvements needed. Thank you for your time and consideration! 🚀