Home/ Questions/Q 795589
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-14T22:30:16+00:00

During my C learning days, when I had implemented a Queue , I implemented

  • 0

During my C learning days, when I had implemented a Queue, I implemented them on top of a LinkedList. So essentially I had two pointers (front and rear) for the Queue operations on top of LinkedList, or better one front pointer on top of a CircularLinkedList.

I am learning the Java Collections Framework, and I observe that the design has completely disjointed the List and Queue interfaces, and the implementations branches out in following fashion –

alt text

I think AbstractQueue should have been subclassed somewhere inside AbstractList. Maybe not inside ArrayList, because I do not want random access to elements, but maybe inside AbstractSequentialList, hmm? (I realize, I could be completely wrong here)

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    This sounds like something done for implementation flexibility: a queue doesn’t have to be implemented as a list (in particular a priority-queue is almost certainly a heap underneath, which is a much more random-access structure than a list can offer).

    • 0