Question

Our homework assignment asks us to prove that the Java LinkedList implementation is doubly-linked and not singly-linked. However, list operations such as adding elements, removing elements, and looking elements up seem to have the same complexity for both implementations, so there doesn’t seem to be a way to use a performance argument to demonstrate the doubly-linked nature of Java’s LinkedList. Anyone know of a better way to illustrate the difference between the two?

Answer 1

Look at iterating in forward or backward direction, removing the “before-last” element, and such.