Actually the essence of the question is where to find it and give the correct name based on the requirements , since I do not think that I have correctly indicated what I am looking for.
Requirements:
1. Insert / delete at the beginning and end of the queue.
2. Can compare objects implementing the Comparable interface for "stuffing" into a queue in a specific order. Just like in PriorityQueue .
3. Implementation is not very important.

  • I kind of realized that this is DEPQ according to my requirements and even found a class that does what it needs. - Dark Casual

1 answer 1

This data structure is called DEPQ