removals-from-the-middle

Constant-time removals in Michael-Scott queue

In src/MSQueueWithConstantTimeRemove.kt, implement a Michael-Scott queue with an additional remove(element) operation. The implementation should find the first node that contains the specified element in linear time, but remove this node in constant time.

Write your first and last name in the headers of the files after the @author tag.

To test your solution, please run:

• ./gradlew test on Linux or MacOS
• gradlew test on Windows