Even in a self-organizing list, if a lowest access probability element (obviously located at the end of the list) is to be accessed, the entire list must be traversed completely to retrieve it.
Čak i u samoorganizovanoj listi, ako treba da se pristupi elementu sa najmanjom verovatnoćom pristupa (očigledno smestenom na kraj liste), cela lista mora da se predje.