Is linkedList.listIterator(linkedList.size()) optimized?

I'm trying to create a reverse ListIterator for a LinkedList, and was going to just implement it as a wrapper to linkedList.listIterator(linkedList.size()) that swaps the next and previous operations, but then realized that if LinkedList#listIterator(int) is implemented to just traverse forwards to the position specified, using it to start at the end would be terribly unoptimized, having to traverse the list twice rather than once, when the list supports going directly to the end. Is linkedList.listIterator(linkedList.size()) optimized to not traverse the entire list?