Implement enqueue(element: E) function for Queues.

[ashikka]

Taking reference from issue #15, implement the enqueue(element: E) function for a queue. This function pushed an element to the tail of the queue.

First step

Search, read, and understand information about queues and how they are implemented.

Second step

After you open a pull request with the data structure implementation, wait for comments or approval from @code-sherpas/kollections-maintainers.

Minimum acceptance criteria

• The implementation must be well documented with proper Javadoc at Class and function levels.
• The implementation must be tested with automatic tests that cover all relevant cases and situations.
• The implementation must be generic.
• The implementation must have the expected time complexity according to Computer Science. Here you can find a very helpful cheat sheet.
• Compare efficiency using a dynamic array as underlying data structure vs using a linked list. Choose the most efficient.

Related resources:

• https://www.youtube.com/watch?v=v4cd1O4zkGw&ab_channel=HackerRank
• https://www.youtube.com/watch?v=wjI1WNcIntg&ab_channel=HackerRank
• https://en.wikipedia.org/wiki/Queue_(abstract_data_type)
• https://www.bigocheatsheet.com/

[Anuka04]

Can I work on this issue? @ashikka

[ashikka]

Can I work on this issue? @ashikka

Sure thing! Thank you for taking it up 🚀

[ashikka]

@Anuka04 have you made any progress? Any blockers?

[Anuka04]

Hey @ashikka I have been under the weather for the past few days will start working as soon as I feel better. Will keep you updated.