Implementing a Queue in Rust.
A queue is a very common data structure with many applications. It belongs to a collection that adheres to the so called FIFO principle, that is, First In First Out. Most basic implementations offer the following methods:
- add : to add an item to the queue
- remove: to remove the item that is longest in the queue
- is_empty: to verify if the queue is empty