Problem
Describe the structure and pseudo-code for an array-based implementation of the array list ADT that achieves O(1) time for insertions and removals at index 0, as well as insertions and removals at the end of the array list. Your implementation should also provide for a constant-time get method. (Hint: Think about how to extend the circular array implementation of the queue ADT given in the previous chapter.