dequeue is a double$-$ended queue, in which the items can be added to or removed from the head or the tail. The dequeue APIs are shown in the below code. Your task is to write the implementation of each function.

For simplicity, we will assume all items stored in the dequeue are integers.

Note: Do not modify the main function.

Note: Do not import $($or include$)$ any libraries from Java.

Note: All APIs must be O$(1)$

Hint: use double linked$-$list implementation.

Input Format

The first line contains the number of queries.

Each of the following lines contains a query $($see the sample test cases$).$

Constraints

It is guaranteed that the number of queries will not exceed $.$

It is guaranteed that all test cases will never cause underflow.

Answer rating: 100% (QA)

To implement a doubleended queue deque using a doubly linked list with constant time complexity for all operations you can define a Node class to repr... View the full answer