In the worst case, the element to be located is at the very end of the list be it a normal list or a self-organized one and thus n comparisons must be made to reach it.
In the best case, the node to be searched is one which has been commonly accessed and has thus been identified by the list and kept at the head.