Suppose we need a List where we often have to remove the front most element. Using our own implementations, is an Array List or a Linked List more efficient, or are they both about the same? What...

Suppose we need a List where we often have to remove the front most element. Using our own implementations, is an Array List or a Linked List more efficient, or are they both about the same? What about using the versions from the Java collections framework? (Hint: An operation that may have to traverse the entire structure is less efficient than one that does not.)