Consider the efficiency of locating the kth element in a doubly-linked list of length n. If k > n/2, it is more efficient to start at the end of the list and move the iterator to the previous element. Why doesn’t this increase in efficiency improve the big-Oh estimate of element access in a doubly-linked list?