In the worst case scenario,either we will find the element in the last node of otherwise we will not find the node after traversal to whole linked list .so to find a node in the worst case we have to traverse all the linked list till the last node ..that's why no. Of comparisons will also be 'n' .and we don't do binary search in Linked list so log n base 2 can never be the our answer.