M-deque
This is an m-deque application implemented in Java for the NYU CSCI 102 Data Structures course. An m-deque is a double-ended queue which can push, pop, and peek the middle element in constant time. This implementation uses a doubly-linked list.
API Documentation
The project specification is available here.
License
This repository is licensed with the MIT license.