为什么ListIterator为LinkedList中的元素提供索引？

Question

Unlike an ArrayList, a LinkedList can not access an element at a particular point using an index.

If this is the case, then what is the point of the ListIterator providing functionality that returns the index of a particular point in a LinkedList?

Why would I ever need to know the index of a LinkedList, if I can't ever use it to access an element. Am I missing something here?

Answer 1

You can use get() for LinkedList, but it has O(n) time complexity so it can be inefficient in some situations. But you can use element index for estimate order of elements in the list or something else depending of your needs.