Skip to content
This repository has been archived by the owner on Sep 6, 2024. It is now read-only.

Deques and Randomized Queues

Vasiliy Azarov edited this page Apr 23, 2021 · 1 revision

A fairly simple task, the essence of which is to implement a doubly linked list and develop its methods.

The essence of this task is to implement the queue through an array, so that we can easily and easily get random elements.

It is especially difficult to immediately create a data structure of the desired size. That will allow you not to waste time on resizing.

Clone this wiki locally